[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_244":245,"_246":247},"routes/_app.x.$handle.$name",{"_105":104,"_38":51,"_114":95,"_33":115,"_13":14,"_116":-5,"_11":117,"_118":119,"_120":121,"_122":123,"_124":125,"_26":-5,"_126":-5,"_127":-5,"_128":31,"_129":130,"_131":64,"_132":-5,"_133":-5,"_134":135},"routes/_app.x.$handle.$name.branch.$branch.version.$version.diff",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":-5},"project",{"_49":50,"_38":51,"_44":52,"_53":-5,"_54":31,"_55":56,"_57":56,"_58":59,"_60":-5,"_19":61,"_62":37,"_63":64,"_65":-5,"_66":-5,"_67":68,"_69":70,"_71":72,"_73":74,"_75":76,"_77":-5,"_78":79,"_80":79,"_81":82,"_83":82,"_84":82,"_85":79,"_86":79,"_87":88,"_89":90,"_91":92,"_93":31},"version",7,"changes",[25],"aiChatInfo",{"_20":21,"_22":-5,"_23":-5,"_24":-5},"userId","aiChatMessageId","63a438cb-b84c-47a4-8499-76f3f389ce6c","aiChatThreadId","aiChatThreadUserId","aiChatThreadTitle",{"_26":27,"_28":29,"_30":31,"_32":31,"_33":34,"_35":34},"file",{"_36":37,"_38":34,"_39":40,"_41":43,"_44":45,"_46":14,"_47":48,"_30":31},"previous",{"_36":37,"_38":34,"_39":40,"_41":42},"deleted",false,"deletedHere","path","index.ts","latestPath","fileId","019f9aba-fced-74dc-b6a6-034297d72dc9","name","fileType","http","content","import { parseVal, serveFile } from \"https://esm.town/v/std/utils/index.ts\";\nimport { Hono } from \"npm:hono\";\n\nconst app = new Hono();\n\n// Serve index.html at the root /\napp.get(\"/\", () => serveFile(\"/frontend/index.html\"));\n\n// Serve all /frontend files\napp.get(\"/frontend/**/*\", (c) => serveFile(c.req.path));\n\n// View source redirect\napp.get(\"/source\", (c) => c.redirect(parseVal().links.self.val));\n\n// Add your API routes here\n// app.get(\"/api/data\", c => c.json({ hello: \"world\" }));\n\n// Unwrap and rethrow Hono errors as the original error\n// If you delete this, all errors will be \"Internal Server Error\"\napp.onError((err) => Promise.reject(err));\n\n// HTTP vals expect an exported \"fetch handler\"\n// This is how you \"run the server\" in Val Town with Hono\nexport default app.fetch;\n","import { parseVal, serveFile } from \"https://esm.town/v/std/utils/index.ts\";\nimport { Hono } from \"npm:hono\";\nimport { generatePuzzle } from \"./backend/generatePuzzle.ts\";\nimport { loadPuzzle, savePuzzle } from \"./backend/store.ts\";\nimport type { Cell } from \"./backend/generatePuzzle.ts\";\n\nconst app = new Hono();\n\n// Serve index.html at the root /\napp.get(\"/\", () => serveFile(\"/frontend/index.html\"));\n\n// Serve all /frontend files\napp.get(\"/frontend/**/*\", (c) => serveFile(c.req.path));\n\n// View source redirect\napp.get(\"/source\", (c) => c.redirect(parseVal().links.self.val));\n\n// --- Game API ---\n\n// Create a new puzzle. Returns the visible grid + clues, but NOT the solution paths.\napp.post(\"/api/puzzle\", async (c) => {\n let opts: Record = {};\n try {\n opts = await c.req.json();\n } catch {\n // no body / not json — use defaults\n }\n const puzzle = await generatePuzzle({\n rows: opts.rows,\n cols: opts.cols,\n wordCount: opts.wordCount,\n minLen: opts.minLen,\n maxLen: opts.maxLen,\n });\n const id = await savePuzzle(puzzle);\n\n // Clues: sorted list of word lengths only. The words themselves are hidden.\n const clues = puzzle.words.map((w) => w.word.length).sort((a, b) => a - b);\n\n return c.json({\n id,\n rows: puzzle.rows,\n cols: puzzle.cols,\n grid: puzzle.grid, // letters (or null) only\n clues,\n wordCount: puzzle.words.length,\n });\n});\n\nconst sameCell = (a: Cell, b: Cell) => a.r === b.r && a.c === b.c;\nconst samePath = (a: Cell[], b: Cell[]) =>\n a.length === b.length && a.every((cell, i) => sameCell(cell, b[i]));\n\n// Check a submitted path against the placed words. A guess is accepted only if\n// its exact cell sequence matches a placed word's path (forward or reversed) —\n// existing in the dictionary or spelling a real word is NOT enough.\napp.post(\"/api/check\", async (c) => {\n const body = await c.req.json().catch(() => null) as\n | { id?: string; path?: Cell[] }\n | null;\n if (!body?.id || !Array.isArray(body.path)) {\n return c.json({ error: \"id and path are required\" }, 400);\n }\n const puzzle = await loadPuzzle(body.id);\n if (!puzzle) return c.json({ error: \"puzzle not found\" }, 404);\n\n const guess = body.path;\n const reversed = guess.slice().reverse();\n\n for (let i = 0; i < puzzle.words.length; i++) {\n const placed = puzzle.words[i];\n if (samePath(guess, placed.path) || samePath(reversed, placed.path)) {\n return c.json({ correct: true, wordIndex: i, word: placed.word, path: placed.path });\n }\n }\n return c.json({ correct: false });\n});\n\n// Reveal the full solution (used by the \"give up\" button).\napp.get(\"/api/solution/:id\", async (c) => {\n const puzzle = await loadPuzzle(c.req.param(\"id\"));\n if (!puzzle) return c.json({ error: \"puzzle not found\" }, 404);\n return c.json({ words: puzzle.words });\n});\n\n// Unwrap and rethrow Hono errors as the original error\napp.onError((err) => Promise.reject(err));\n\nexport default app.fetch;\n","createdAt",["D",1785007444088],"branchVersion","branchId","962e1183-810a-43f3-b35e-f55556d3753b","id","6d7c21e6-13e7-4e47-91b0-e7169f311975","words",["D",1785006829408],"deletedAt","legacyEnvVars","privacy","public","httpPrivacy","description","Word Snake — trace hidden snake-path words on a grid","imageUrl","b0357dde-b3d8-4b57-ae64-48c75ed237e3","pinnedFileId","pinPreview",true,"pinMigrated","screenshotVersion","likeCount",0,"orgId","019f990f-e3e2-73af-886a-bae138a4342d","tursoName","6d7c21e613e74e4791b0e7169f311975","tursoHostname","6d7c21e613e74e4791b0e7169f311975-val-town.aws-us-east-2.turso.io","tursoMeasuredAt",["D",1789474235934],"pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm","user",{"_105":104,"_113":109},"org",{"_105":104,"_106":107,"_108":109,"_19":61,"_110":111,"_112":31},"branch",{"_13":94,"_38":95,"_49":48,"_96":50,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_101":-5,"_102":51,"_103":104},"isOwned",14,"main","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","nsivukhin","handle","displayName","Nikita Sivukhin","avatar","https://lh3.googleusercontent.com/a/ACg8ocLk4CcmZUgY2xqNPiDGdQH5Yi149UXPXY0titk2reTLCRsTjGI=s96-c","tier","free","canRestrictVals","profileImageUrl","branchName","","adoptOrgId",{"_49":50,"_38":51,"_44":239,"_53":-5,"_54":31,"_55":56,"_57":56,"_58":59,"_60":-5,"_19":61,"_62":37,"_63":64,"_65":-5,"_66":-5,"_67":68,"_69":70,"_71":72,"_73":74,"_75":240,"_77":-5,"_78":79,"_80":79,"_81":82,"_83":82,"_84":82,"_85":79,"_86":79,"_87":241,"_89":242,"_91":243,"_93":31},"tree",[169,172,178],"files",[169,170,171,172,173,174,175,176,177,178],"counts",{"_159":68,"_160":143,"_161":68,"_162":163,"_164":165},"contents",[136,137,138],"upstreamProject","upstreamBranch","emptyEnvVars","flags",[],"hasHttpFiles","grants","orgs","customDomains",{},{"_49":153,"_38":154,"_36":155,"_140":-5,"_47":48,"_46":156,"_141":64,"_44":157,"_13":68,"_39":151,"_41":-5,"_30":31,"_144":-5,"_33":158},{"_49":146,"_38":147,"_36":148,"_140":-5,"_47":48,"_46":149,"_141":64,"_44":150,"_13":68,"_39":151,"_41":-5,"_30":31,"_144":-5,"_33":152},{"_49":139,"_38":34,"_36":37,"_140":-5,"_47":48,"_46":14,"_141":64,"_44":142,"_13":143,"_39":40,"_41":43,"_30":31,"_144":-5,"_33":145},"d8ca29ba-7ea9-4ad5-9dc1-f5ea2603859b","parentId","latest",["D",1785007444088],1,"label",[34],"2f9e8e7d-4e5a-4d85-b1d9-42ec889c4c77","frontend","019f9aba-fced-74dc-b6a6-06336ef108cb",2,["D",1785007373549],"directory",[147],"7ba34d46-11c0-4f85-bf6d-de4a1cca9758","backend","e4669e36-b274-4ce7-85ee-4029b751b8d7",5,["D",1785007403208],[154],"pulls","branches","forks","envVars",{"_166":68,"_168":68},"connections",{"_166":68,"_167":68},"count","unfilledCount","emptyCount",{"_49":153,"_38":154,"_36":155,"_140":-5,"_47":48,"_46":156,"_141":64,"_44":236,"_13":68,"_39":151,"_41":-5,"_30":31,"_144":-5,"_180":237,"_33":238},{"_49":229,"_38":230,"_36":231,"_140":155,"_47":48,"_46":156,"_141":64,"_44":232,"_13":68,"_39":187,"_41":233,"_30":31,"_144":-5,"_180":234,"_33":235},{"_49":221,"_38":222,"_36":223,"_140":155,"_47":48,"_46":224,"_141":64,"_44":225,"_13":68,"_39":187,"_41":226,"_30":31,"_144":-5,"_180":227,"_33":228},{"_49":146,"_38":147,"_36":148,"_140":-5,"_47":48,"_46":149,"_141":64,"_44":218,"_13":68,"_39":151,"_41":-5,"_30":31,"_144":-5,"_180":219,"_33":220},{"_49":214,"_38":213,"_36":208,"_140":148,"_47":48,"_46":149,"_141":64,"_44":215,"_13":68,"_39":151,"_41":-5,"_30":31,"_144":-5,"_180":216,"_33":217},{"_49":205,"_38":206,"_36":207,"_140":208,"_47":48,"_46":149,"_141":31,"_44":209,"_13":68,"_39":187,"_41":210,"_30":31,"_144":-5,"_180":211,"_33":212},{"_49":198,"_38":199,"_36":200,"_140":148,"_47":48,"_46":149,"_141":64,"_44":201,"_13":68,"_39":26,"_41":202,"_30":31,"_144":-5,"_180":203,"_33":204},{"_49":191,"_38":192,"_36":193,"_140":148,"_47":48,"_46":149,"_141":31,"_44":194,"_13":68,"_39":26,"_41":195,"_30":31,"_144":-5,"_180":196,"_33":197},{"_49":183,"_38":184,"_36":185,"_140":148,"_47":48,"_46":149,"_141":64,"_44":186,"_13":68,"_39":187,"_41":188,"_30":31,"_144":-5,"_180":189,"_33":190},{"_49":139,"_38":34,"_36":37,"_140":-5,"_47":48,"_46":14,"_141":64,"_44":179,"_13":143,"_39":40,"_41":43,"_30":31,"_144":-5,"_180":181,"_33":182},["D",1785007444088],"children",[],[34],"182d49d0-d4a7-48b4-ba9c-e29ee943e0a1","index.tsx","019f9aba-fced-74dc-b6a6-1d6826eff6e2",["D",1785007373549],"script","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport { App } from \"./components/App.tsx\";\n\nconst root = document.getElementById(\"root\");\nif (!root) {\n throw new Error(\"No root element found\");\n}\n\ncreateRoot(root).render();",[],[147,184],"04da09a6-f8b2-4612-b424-ee001f4efac4","index.html","019f9aba-fced-74dc-b6a6-1b7a2cfca7b8",["D",1785007373549],"\n\n \n \n \n React Hono Val Town Starter\n \n \n \n \n

\n \n \n \n",[],[147,192],"85d3e2f7-481e-49c3-9a18-f565a8d98166","favicon.svg","019f9aba-fced-74dc-b6a6-170a808d083c",["D",1785007373549],"\n",[],[147,199],"5e2be9bd-5ed2-441e-81e4-faaea8b9ff31","App.tsx","019f9aba-fced-74dc-b6a6-0c8462cc2e84","019f9aba-fced-74dc-b6a6-0a1ae671be68",["D",1785007373549],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { Counter } from \"./Counter.tsx\";\n\nexport function App() {\n return (\n

React + Hono Starter

\n \n

\n View source\n

\n );\n}\n",[],[147,213,206],"components","dde1f63f-8943-4245-92b3-52bf459eba05",["D",1785007373549],[174],[147,213],["D",1785007373549],[173,175,176,177],[147],"1d020e19-c99a-4598-9450-15318c69110c","store.ts","527da93e-885e-11f1-8e70-1607ee4eb77e",6,["D",1785007411736],"import { sqlite } from \"https://esm.town/v/std/sqlite/main.ts\";\nimport type { Puzzle } from \"./generatePuzzle.ts\";\n\nconst TABLE = \"puzzles_v1\";\n\nlet initialized = false;\nasync function init() {\n if (initialized) return;\n await sqlite.execute(\n `CREATE TABLE IF NOT EXISTS ${TABLE} (\n id TEXT PRIMARY KEY,\n data TEXT NOT NULL,\n created_at INTEGER NOT NULL\n )`,\n );\n initialized = true;\n}\n\nexport async function savePuzzle(puzzle: Puzzle): Promise {\n await init();\n const id = crypto.randomUUID();\n await sqlite.execute({\n sql: `INSERT INTO ${TABLE} (id, data, created_at) VALUES (?, ?, ?)`,\n args: [id, JSON.stringify(puzzle), Date.now()],\n });\n return id;\n}\n\nexport async function loadPuzzle(id: string): Promise {\n await init();\n const res = await sqlite.execute({\n sql: `SELECT data FROM ${TABLE} WHERE id = ?`,\n args: [id],\n });\n if (res.rows.length === 0) return null;\n return JSON.parse(String(res.rows[0][0])) as Puzzle;\n}\n",[],[154,222],"cf32c54e-5de0-4ea5-b788-9615748feb29","generatePuzzle.ts","4d68b04c-885e-11f1-ba79-1607ee4eb77e",["D",1785007403208],"import { sqlite } from \"https://esm.town/v/std/sqlite/main.ts\";\n\n// A cell coordinate on the grid.\nexport interface Cell {\n r: number;\n c: number;\n}\n\n// A placed word: the word text plus the exact ordered snake-path of cells it occupies.\nexport interface PlacedWord {\n word: string;\n path: Cell[]; // path[i] holds word[i]\n}\n\nexport interface Puzzle {\n rows: number;\n cols: number;\n // grid[r][c] is a single uppercase letter, or null for an empty (unoccupied) cell.\n grid: (string | null)[][];\n words: PlacedWord[];\n}\n\n// 8-directional (king move) neighbors.\nconst DIRS: Cell[] = [\n { r: -1, c: -1 },\n { r: -1, c: 0 },\n { r: -1, c: 1 },\n { r: 0, c: -1 },\n { r: 0, c: 1 },\n { r: 1, c: -1 },\n { r: 1, c: 0 },\n { r: 1, c: 1 },\n];\n\nfunction shuffle(arr: T[]): T[] {\n const a = arr.slice();\n for (let i = a.length - 1; i > 0; i--) {\n const j = Math.floor(Math.random() * (i + 1));\n [a[i], a[j]] = [a[j], a[i]];\n }\n return a;\n}\n\nconst key = (r: number, c: number) => `${r},${c}`;\n\n/**\n * Try to lay `word` as a self-avoiding snake path on the grid, using only cells\n * that are currently empty (not occupied by a previously placed word).\n * Returns the ordered path of cells, or null if it couldn't be placed.\n */\nfunction tryPlaceWord(\n word: string,\n rows: number,\n cols: number,\n occupied: Set,\n): Cell[] | null {\n const used = new Set(); // cells used by THIS word's current path attempt\n\n // Depth-first search that grows the path one letter at a time.\n function dfs(path: Cell[]): Cell[] | null {\n if (path.length === word.length) return path.slice();\n const last = path[path.length - 1];\n for (const d of shuffle(DIRS)) {\n const nr = last.r + d.r;\n const nc = last.c + d.c;\n if (nr < 0 || nc < 0 || nr >= rows || nc >= cols) continue;\n const k = key(nr, nc);\n if (occupied.has(k) || used.has(k)) continue;\n used.add(k);\n path.push({ r: nr, c: nc });\n const res = dfs(path);\n if (res) return res;\n path.pop();\n used.delete(k);\n }\n return null;\n }\n\n // Try a number of random starting cells.\n const starts = shuffle(\n Array.from({ length: rows * cols }, (_, i) => ({ r: Math.floor(i / cols), c: i % cols })),\n );\n for (const start of starts) {\n const k = key(start.r, start.c);\n if (occupied.has(k)) continue;\n used.clear();\n used.add(k);\n const res = dfs([start]);\n if (res) return res;\n }\n return null;\n}\n\n/**\n * Fetch `count` random distinct words from the dictionary, each with length in\n * [minLen, maxLen].\n */\nasync function pickWords(count: number, minLen: number, maxLen: number): Promise {\n const res = await sqlite.execute({\n sql:\n `SELECT DISTINCT word FROM words WHERE length(word) BETWEEN ? AND ? ORDER BY RANDOM() LIMIT ?`,\n args: [minLen, maxLen, count],\n });\n return res.rows.map((row) => String(row[0]).toUpperCase());\n}\n\nexport interface GenerateOptions {\n rows?: number;\n cols?: number;\n wordCount?: number;\n minLen?: number;\n maxLen?: number;\n}\n\n/**\n * Generate a puzzle: place several words as snake-paths on a grid, leaving some\n * cells empty. Retries word selection/placement until it succeeds.\n */\nexport async function generatePuzzle(opts: GenerateOptions = {}): Promise {\n const rows = opts.rows ?? 7;\n const cols = opts.cols ?? 7;\n const wordCount = opts.wordCount ?? 5;\n const minLen = opts.minLen ?? 4;\n const maxLen = opts.maxLen ?? 7;\n\n // Try a few full attempts (fresh word sets) before giving up.\n for (let attempt = 0; attempt < 12; attempt++) {\n // Over-fetch so we have spare words to try if some don't fit.\n const pool = await pickWords(wordCount * 3, minLen, maxLen);\n if (pool.length < wordCount) continue;\n\n // Place longest words first — they're the hardest to fit.\n const sorted = pool.sort((a, b) => b.length - a.length);\n\n const occupied = new Set();\n const placed: PlacedWord[] = [];\n\n for (const word of sorted) {\n if (placed.length === wordCount) break;\n const path = tryPlaceWord(word, rows, cols, occupied);\n if (!path) continue;\n for (const cell of path) occupied.add(key(cell.r, cell.c));\n placed.push({ word, path });\n }\n\n if (placed.length < wordCount) continue;\n\n // Build the visible grid.\n const grid: (string | null)[][] = Array.from(\n { length: rows },\n () => Array.from({ length: cols }, () => null as string | null),\n );\n for (const pw of placed) {\n pw.path.forEach((cell, i) => {\n grid[cell.r][cell.c] = pw.word[i];\n });\n }\n\n return { rows, cols, grid, words: placed };\n }\n\n throw new Error(\"Could not generate a puzzle after several attempts\");\n}\n",[],[154,230],["D",1785007403208],[170,171],[154],["D",1785006829408],["D",1789474235934],{"_105":104,"_113":109},{"_105":104,"_106":107,"_108":109,"_19":61,"_110":111,"_112":31},{"_13":94,"_38":95,"_49":48,"_96":50,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_101":-5,"_102":51,"_103":104},"ctx",{"_87":-5,"_133":277,"_278":279,"_280":281,"_282":31,"_283":31,"_284":31,"_285":64,"_286":-5,"_287":-7,"_288":-7,"_289":68,"_290":31,"_291":31,"_292":-5,"_293":31,"_294":31,"_295":31,"_296":-5},"ENV",{"_248":249,"_250":251,"_252":95,"_253":254,"_255":256,"_257":258,"_259":260,"_261":262,"_263":264,"_265":266,"_267":268,"_269":270,"_271":272,"_273":274,"_275":276},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","e87eb04e707cf64e7e532c8e8ec395f209e17f15","RENDER_GIT_BRANCH","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","CLOUDFLARE_TURNSTILE_SITE_KEY","0x4AAAAAACtaIZJH7s9rBMZ6","GOOGLE_CLIENT_ID","875989696899-jtsqkhlbdv5jrlsk8631p7ipjg3c6o62.apps.googleusercontent.com","STRIPE_PUBLISHABLE_KEY","pk_live_51N2zvWEpZTTLipIkVEwXrUG9AT0yeOOEYxszarZT1jpsZV58Ly6wlg3SltZpHN26CUalOBmUSY7adQRQiSkCZz2500qSXNkf8Y","API_URL","https://api.val.town",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]

Diff · v7