\n \n \n \n","label",[165,65],"frontend","pulls","branches","forks","envVars",{"_173":26,"_175":26},"connections",{"_173":26,"_174":26},"count","unfilledCount","emptyCount",{"_33":294,"_13":285,"_63":279,"_43":-5,"_35":36,"_157":289,"_158":93,"_37":295,"_39":26,"_66":269,"_161":-5,"_67":24,"_163":-5,"_197":296,"_17":297},{"_33":286,"_13":287,"_63":288,"_43":279,"_35":36,"_157":289,"_158":93,"_37":290,"_39":26,"_66":212,"_161":291,"_67":24,"_163":-5,"_197":292,"_17":293},{"_33":276,"_13":277,"_63":278,"_43":279,"_35":36,"_157":280,"_158":93,"_37":281,"_39":26,"_66":212,"_161":282,"_67":24,"_163":-5,"_197":283,"_17":284},{"_33":272,"_13":165,"_63":156,"_43":-5,"_35":36,"_157":40,"_158":93,"_37":273,"_39":26,"_66":269,"_161":-5,"_67":24,"_163":-5,"_197":274,"_17":275},{"_33":267,"_13":250,"_63":244,"_43":156,"_35":36,"_157":40,"_158":93,"_37":268,"_39":26,"_66":269,"_161":-5,"_67":24,"_163":-5,"_197":270,"_17":271},{"_33":259,"_13":260,"_63":261,"_43":244,"_35":36,"_157":262,"_158":93,"_37":263,"_39":160,"_66":212,"_161":264,"_67":24,"_163":-5,"_197":265,"_17":266},{"_33":251,"_13":252,"_63":253,"_43":244,"_35":36,"_157":254,"_158":93,"_37":255,"_39":26,"_66":212,"_161":256,"_67":24,"_163":-5,"_197":257,"_17":258},{"_33":241,"_13":242,"_63":243,"_43":244,"_35":36,"_157":245,"_158":93,"_37":246,"_39":26,"_66":212,"_161":247,"_67":24,"_163":-5,"_197":248,"_17":249},{"_33":233,"_13":234,"_63":235,"_43":156,"_35":36,"_157":236,"_158":93,"_37":237,"_39":26,"_66":212,"_161":238,"_67":24,"_163":-5,"_197":239,"_17":240},{"_33":226,"_13":227,"_63":228,"_43":156,"_35":36,"_157":40,"_158":93,"_37":229,"_39":26,"_66":21,"_161":230,"_67":24,"_163":-5,"_197":231,"_17":232},{"_33":155,"_13":65,"_63":64,"_43":156,"_35":36,"_157":73,"_158":93,"_37":223,"_39":160,"_66":21,"_161":162,"_67":24,"_163":-5,"_197":224,"_17":225},{"_33":216,"_13":217,"_63":218,"_43":156,"_35":36,"_157":40,"_158":93,"_37":219,"_39":26,"_66":212,"_161":220,"_67":24,"_163":-5,"_197":221,"_17":222},{"_33":207,"_13":208,"_63":209,"_43":156,"_35":36,"_157":210,"_158":93,"_37":211,"_39":26,"_66":212,"_161":213,"_67":24,"_163":-5,"_197":214,"_17":215},{"_33":200,"_13":201,"_63":202,"_43":-5,"_35":36,"_157":119,"_158":93,"_37":203,"_39":26,"_66":21,"_161":204,"_67":24,"_163":-5,"_197":205,"_17":206},{"_33":191,"_13":192,"_63":91,"_43":-5,"_35":36,"_157":193,"_158":93,"_37":194,"_39":160,"_66":195,"_161":196,"_67":24,"_163":-5,"_197":198,"_17":199},"d8ca29ba-7ea9-4ad5-9dc1-f5ea2603859b","index.ts",7,["D",1785007444088],"http","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","children",[],[192],"edbec180-3d1f-4947-a0ff-02a6de0aab06","README.md","bdc7ca6c-885e-11f1-9222-1607ee4eb77e",["D",1785007591674],"# 🐍 Word Snake\n\nA word-search game where hidden words are placed on a grid as **snake-paths**\n(each word winds through king-adjacent cells — horizontal, vertical, or\ndiagonal). Some cells are left empty. Your only clues are **how many words** are\nhidden and **their lengths**.\n\nDrag your finger/mouse from letter to letter to trace a path. A guess is\naccepted **only if it matches where a word was actually placed** — spelling a\nword that merely exists in the dictionary, or exists elsewhere on the grid,\ndoesn't count. This is enforced server-side: the browser never sees the\nsolution.\n\n## How it works\n\n```mermaid\nflowchart LR\n A[Browser] -- \"POST /api/puzzle\" --> B[index.ts]\n B --> C[generatePuzzle.ts
place words as snake-paths]\n C -- reads --> D[(words table)]\n B -- saves solution --> E[(puzzles_v1 table)]\n B -- \"grid + clues only
(no solution)\" --> A\n A -- \"POST /api/check
{id, path}\" --> B\n B -- \"load solution\" --> E\n B -- \"correct? + word\" --> A\n```\n\n- **`backend/generatePuzzle.ts`** — picks random words from the `words`\n dictionary table and lays each one as a self-avoiding snake-path via\n backtracking DFS. Words never share cells; unused cells stay empty.\n- **`backend/store.ts`** — persists each generated puzzle (including the exact\n placed paths) in SQLite so the server can validate guesses. The client only\n receives letters + clues.\n- **`index.ts`** — Hono HTTP server. Routes:\n - `POST /api/puzzle` → new puzzle (grid + word-length clues, no solution)\n - `POST /api/check` → `{ id, path }`; accepted only if `path` exactly matches\n a placed word's cells (forward or reversed)\n - `GET /api/solution/:id` → full solution (used by \"Give up\")\n- **`frontend/`** — client-side React (via Twind/Tailwind). `Grid.tsx` handles\n the pointer/touch drag; `Clues.tsx` shows the length clues that fill in as you\n solve; `App.tsx` orchestrates difficulty, state, and win detection.\n\n## Difficulty\n\n| Level | Grid | Words | Lengths |\n| ------ | ---- | ----- | ------- |\n| Easy | 6×6 | 3 | 4–6 |\n| Medium | 7×7 | 5 | 4–7 |\n| Hard | 8×8 | 7 | 5–8 |\n\n## Dictionary\n\nWords come from the `words` table (`CREATE TABLE words (word TEXT)`). Add more\nrows to expand the vocabulary — nothing else needs to change.\n",[],[201],"bb7db1f0-082b-4736-b8dd-627fb747114a","types.ts","74825994-885e-11f1-ba79-1607ee4eb77e",8,["D",1785007468809],"script","export interface Cell {\n r: number;\n c: number;\n}\n\nexport interface Puzzle {\n id: string;\n rows: number;\n cols: number;\n grid: (string | null)[][];\n clues: number[]; // sorted word lengths\n wordCount: number;\n}\n\nexport interface CheckResult {\n correct: boolean;\n wordIndex?: number;\n word?: string;\n path?: Cell[];\n}\n\n// A word the player has already found.\nexport interface Found {\n word: string;\n path: Cell[];\n}\n",[],[165,208],"182d49d0-d4a7-48b4-ba9c-e29ee943e0a1","index.tsx","019f9aba-fced-74dc-b6a6-1d6826eff6e2",["D",1785007373549],"/** @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();",[],[165,217],["D",1785007551525],[],[165,65],"85d3e2f7-481e-49c3-9a18-f565a8d98166","favicon.svg","019f9aba-fced-74dc-b6a6-170a808d083c",["D",1785007373549],"\n",[],[165,227],"905e2e85-8aa8-484c-b77f-29e32c67dea6","api.ts","773cffa4-885e-11f1-b759-1607ee4eb77e",9,["D",1785007473389],"import type { Cell, CheckResult, Puzzle } from \"./types.ts\";\n\nexport interface PuzzleOptions {\n rows?: number;\n cols?: number;\n wordCount?: number;\n minLen?: number;\n maxLen?: number;\n}\n\nexport async function newPuzzle(opts: PuzzleOptions = {}): Promise {\n const res = await fetch(\"/api/puzzle\", {\n method: \"POST\",\n headers: { \"Content-Type\": \"application/json\" },\n body: JSON.stringify(opts),\n });\n if (!res.ok) throw new Error(`Failed to create puzzle (${res.status})`);\n return res.json();\n}\n\nexport async function checkPath(id: string, path: Cell[]): Promise {\n const res = await fetch(\"/api/check\", {\n method: \"POST\",\n headers: { \"Content-Type\": \"application/json\" },\n body: JSON.stringify({ id, path }),\n });\n if (!res.ok) throw new Error(`Check failed (${res.status})`);\n return res.json();\n}\n\nexport async function getSolution(id: string): Promise<{ word: string; path: Cell[] }[]> {\n const res = await fetch(`/api/solution/${id}`);\n if (!res.ok) throw new Error(`Failed to load solution (${res.status})`);\n const data = await res.json();\n return data.words;\n}\n",[],[165,234],"5bf89419-41b2-4103-bd1c-cd2230c722d0","Grid.tsx","8a03ab88-885e-11f1-bfd2-1607ee4eb77e","019f9aba-fced-74dc-b6a6-0a1ae671be68",10,["D",1785007504888],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport React, { useCallback, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\nimport type { Cell, Found } from \"../types.ts\";\n\ninterface GridProps {\n grid: (string | null)[][];\n found: Found[]; // already-solved words, drawn permanently\n onSubmit: (path: Cell[]) => void;\n flash: { path: Cell[]; ok: boolean } | null; // transient wrong/right feedback\n}\n\nconst CELL = 48; // px\nconst GAP = 6; // px\n\nconst cellKey = (c: Cell) => `${c.r},${c.c}`;\nconst adjacent = (a: Cell, b: Cell) =>\n Math.max(Math.abs(a.r - b.r), Math.abs(a.c - b.c)) === 1;\n\n// A palette of pleasant colors for solved words.\nconst WORD_COLORS = [\n \"#f97316\",\n \"#0ea5e9\",\n \"#22c55e\",\n \"#a855f7\",\n \"#ec4899\",\n \"#eab308\",\n \"#14b8a6\",\n \"#ef4444\",\n];\n\nexport function Grid({ grid, found, onSubmit, flash }: GridProps) {\n const rows = grid.length;\n const cols = grid[0]?.length ?? 0;\n const [drag, setDrag] = useState([]);\n const dragging = useRef(false);\n const wrapRef = useRef(null);\n\n // Map every cell that belongs to a solved word -> its color.\n const solvedColor = new Map();\n found.forEach((f, i) => {\n const color = WORD_COLORS[i % WORD_COLORS.length];\n for (const cell of f.path) solvedColor.set(cellKey(cell), color);\n });\n\n const inDrag = new Set(drag.map(cellKey));\n\n const cellFromPoint = useCallback((x: number, y: number): Cell | null => {\n const el = document.elementFromPoint(x, y) as HTMLElement | null;\n const attr = el?.closest(\"[data-cell]\")?.getAttribute(\"data-cell\");\n if (!attr) return null;\n const [r, c] = attr.split(\",\").map(Number);\n if (grid[r]?.[c] == null) return null; // empty cell — not selectable\n return { r, c };\n }, [grid]);\n\n const extend = useCallback((cell: Cell) => {\n setDrag((prev) => {\n if (prev.length === 0) return [cell];\n const last = prev[prev.length - 1];\n if (last.r === cell.r && last.c === cell.c) return prev;\n // Backtrack: hovering the previous cell removes the last one.\n if (prev.length >= 2) {\n const prevPrev = prev[prev.length - 2];\n if (prevPrev.r === cell.r && prevPrev.c === cell.c) return prev.slice(0, -1);\n }\n // Otherwise only extend to an adjacent, unused cell.\n if (!adjacent(last, cell)) return prev;\n if (prev.some((p) => p.r === cell.r && p.c === cell.c)) return prev;\n return [...prev, cell];\n });\n }, []);\n\n const start = useCallback((cell: Cell) => {\n dragging.current = true;\n setDrag([cell]);\n }, []);\n\n const end = useCallback(() => {\n if (!dragging.current) return;\n dragging.current = false;\n setDrag((prev) => {\n if (prev.length >= 2) onSubmit(prev);\n return [];\n });\n }, [onSubmit]);\n\n // Global pointer listeners so the drag keeps working outside a single cell.\n useEffect(() => {\n const move = (e: PointerEvent) => {\n if (!dragging.current) return;\n e.preventDefault();\n const cell = cellFromPoint(e.clientX, e.clientY);\n if (cell) extend(cell);\n };\n const up = () => end();\n globalThis.addEventListener(\"pointermove\", move, { passive: false });\n globalThis.addEventListener(\"pointerup\", up);\n globalThis.addEventListener(\"pointercancel\", up);\n return () => {\n globalThis.removeEventListener(\"pointermove\", move);\n globalThis.removeEventListener(\"pointerup\", up);\n globalThis.removeEventListener(\"pointercancel\", up);\n };\n }, [cellFromPoint, extend, end]);\n\n const flashSet = new Set((flash?.path ?? []).map(cellKey));\n\n const width = cols * CELL + (cols - 1) * GAP;\n const height = rows * CELL + (rows - 1) * GAP;\n const center = (i: number) => i * (CELL + GAP) + CELL / 2;\n\n // Build SVG polyline points for the in-progress drag path.\n const dragPoints = drag.map((c) => `${center(c.c)},${center(c.r)}`).join(\" \");\n\n return (\n \n {/* Connector lines for solved words + current drag */}\n \n {found.map((f, i) => (\n `${center(c.c)},${center(c.r)}`).join(\" \")}\n fill=\"none\"\n stroke={WORD_COLORS[i % WORD_COLORS.length]}\n strokeWidth={10}\n strokeLinecap=\"round\"\n strokeLinejoin=\"round\"\n opacity={0.35}\n />\n ))}\n {drag.length >= 2 && (\n \n )}\n \n\n {/* Cells */}\n {grid.map((row, r) =>\n row.map((letter, c) => {\n if (letter == null) {\n return (\n \n );\n }\n const k = `${r},${c}`;\n const solved = solvedColor.get(k);\n const selected = inDrag.has(k);\n const isFlash = flashSet.has(k);\n let bg = \"#ffffff\";\n let fg = \"#1f2937\";\n let border = \"#e5e7eb\";\n if (solved) {\n bg = solved;\n fg = \"#ffffff\";\n border = solved;\n }\n if (selected) {\n bg = \"#2563eb\";\n fg = \"#ffffff\";\n border = \"#1d4ed8\";\n }\n if (isFlash) {\n bg = flash!.ok ? \"#16a34a\" : \"#dc2626\";\n fg = \"#ffffff\";\n border = bg;\n }\n return (\n {\n e.preventDefault();\n start({ r, c });\n }}\n className=\"absolute rounded-lg flex items-center justify-center font-bold text-lg cursor-pointer transition-colors\"\n style={{\n left: c * (CELL + GAP),\n top: r * (CELL + GAP),\n width: CELL,\n height: CELL,\n background: bg,\n color: fg,\n border: `2px solid ${border}`,\n boxShadow: \"0 1px 2px rgba(0,0,0,0.06)\",\n }}\n >\n {letter}\n \n );\n })\n )}\n \n );\n}\n",[],[165,250,242],"components","6127248d-980a-4a58-9eb3-c838663ef559","Clues.tsx","91941e3c-885e-11f1-a9a0-1607ee4eb77e",11,["D",1785007517565],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport React from \"https://esm.sh/react@18.2.0\";\nimport type { Found } from \"../types.ts\";\n\ninterface CluesProps {\n clues: number[]; // sorted word lengths\n found: Found[];\n}\n\n/**\n * Show one \"slot\" per word. Each slot displays either the word's length (as\n * boxes) if unsolved, or the revealed word once found. We greedily match found\n * words to clue slots by length so each found word ticks off one clue.\n */\nexport function Clues({ clues, found }: CluesProps) {\n // Count how many found words we have of each length, to mark slots solved.\n const foundByLen = new Map();\n for (const f of found) {\n const arr = foundByLen.get(f.word.length) ?? [];\n arr.push(f.word);\n foundByLen.set(f.word.length, arr);\n }\n // Clone so we can pop as we assign.\n const remaining = new Map();\n for (const [len, arr] of foundByLen) remaining.set(len, arr.slice());\n\n return (\n

\n {found.length} / {clues.length} found\n

\n {clues.map((len, i) => {\n const pool = remaining.get(len);\n const solvedWord = pool && pool.length ? pool.shift() : undefined;\n return (\n

\n {len}\n {Array.from({ length: len }).map((_, j) => (\n \n {solvedWord ? solvedWord[j] : \"•\"}\n \n ))}\n

\n );\n })}\n

\n );\n}\n",[],[165,250,252],"2815097a-2f61-456a-b030-be969cfe60bb","App.tsx","019f9aba-fced-74dc-b6a6-0c8462cc2e84",12,["D",1785007545826],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport React, { useCallback, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\nimport { Grid } from \"./Grid.tsx\";\nimport { Clues } from \"./Clues.tsx\";\nimport { checkPath, getSolution, newPuzzle, type PuzzleOptions } from \"../api.ts\";\nimport type { Cell, Found, Puzzle } from \"../types.ts\";\n\ntype Difficulty = \"easy\" | \"medium\" | \"hard\";\n\nconst DIFFICULTIES: Record = {\n easy: { label: \"Easy\", rows: 6, cols: 6, wordCount: 3, minLen: 4, maxLen: 6 },\n medium: { label: \"Medium\", rows: 7, cols: 7, wordCount: 5, minLen: 4, maxLen: 7 },\n hard: { label: \"Hard\", rows: 8, cols: 8, wordCount: 7, minLen: 5, maxLen: 8 },\n};\n\nconst cellKey = (c: Cell) => `${c.r},${c.c}`;\n\nexport function App() {\n const [difficulty, setDifficulty] = useState(\"medium\");\n const [puzzle, setPuzzle] = useState(null);\n const [found, setFound] = useState([]);\n const [loading, setLoading] = useState(false);\n const [error, setError] = useState(null);\n const [flash, setFlash] = useState<{ path: Cell[]; ok: boolean } | null>(null);\n const [message, setMessage] = useState(null);\n const [revealed, setRevealed] = useState(false);\n const flashTimer = useRef(null);\n\n const load = useCallback(async (diff: Difficulty) => {\n setLoading(true);\n setError(null);\n setFound([]);\n setFlash(null);\n setMessage(null);\n setRevealed(false);\n try {\n const p = await newPuzzle(DIFFICULTIES[diff]);\n setPuzzle(p);\n } catch (e) {\n setError(e instanceof Error ? e.message : String(e));\n } finally {\n setLoading(false);\n }\n }, []);\n\n useEffect(() => {\n load(difficulty);\n // eslint-disable-next-line react-hooks/exhaustive-deps\n }, []);\n\n const showFlash = useCallback((path: Cell[], ok: boolean) => {\n if (flashTimer.current) clearTimeout(flashTimer.current);\n setFlash({ path, ok });\n flashTimer.current = globalThis.setTimeout(() => setFlash(null), 600);\n }, []);\n\n const foundKeys = new Set(found.flatMap((f) => f.path.map(cellKey)));\n\n const onSubmit = useCallback(async (path: Cell[]) => {\n if (!puzzle || revealed) return;\n // Ignore paths that touch already-solved cells.\n if (path.some((c) => foundKeys.has(cellKey(c)))) return;\n try {\n const res = await checkPath(puzzle.id, path);\n if (res.correct && res.word && res.path) {\n // Avoid double-adding the same word.\n setFound((prev) =>\n prev.some((f) => f.word === res.word && f.path[0].r === res.path![0].r)\n ? prev\n : [...prev, { word: res.word!, path: res.path! }]\n );\n showFlash(res.path, true);\n setMessage(`Nice! Found \"${res.word}\"`);\n } else {\n showFlash(path, false);\n setMessage(\"Not a placed word there — try again.\");\n }\n } catch (e) {\n setError(e instanceof Error ? e.message : String(e));\n }\n }, [puzzle, revealed, found, showFlash]);\n\n const reveal = useCallback(async () => {\n if (!puzzle) return;\n try {\n const words = await getSolution(puzzle.id);\n setFound(words.map((w) => ({ word: w.word, path: w.path })));\n setRevealed(true);\n setMessage(\"Solution revealed.\");\n } catch (e) {\n setError(e instanceof Error ? e.message : String(e));\n }\n }, [puzzle]);\n\n const won = puzzle != null && !revealed && found.length === puzzle.wordCount;\n\n return (\n

🐍 Word Snake

\n Trace each hidden word as a snake-path through adjacent letters.\n

\n\n {/* Controls */}\n

\n {(Object.keys(DIFFICULTIES) as Difficulty[]).map((d) => (\n {\n setDifficulty(d);\n load(d);\n }}\n className={`px-3 py-1.5 rounded-full text-sm font-semibold border transition-colors ${\n difficulty === d\n ? \"bg-gray-900 text-white border-gray-900\"\n : \"bg-white text-gray-700 border-gray-300 hover:border-gray-500\"\n }`}\n >\n {DIFFICULTIES[d].label}\n \n ))}\n load(difficulty)}\n className=\"px-3 py-1.5 rounded-full text-sm font-semibold bg-blue-600 text-white hover:bg-blue-700\"\n >\n New puzzle\n \n \n Give up\n \n

\n\n {error && (\n

\n {error}\n

\n )}\n\n {loading && (\n

Generating puzzle…

\n )}\n\n {puzzle && !loading && (\n

\n \n

\n {won\n ? (\n \n 🎉 You found all {puzzle.wordCount} words!\n \n )\n : {message}}\n

\n \n

\n )}\n\n \n

\n );\n}\n",[],[165,250,260],"dde1f63f-8943-4245-92b3-52bf459eba05",["D",1785007373549],"directory",[181,182,183],[165,250],"2f9e8e7d-4e5a-4d85-b1d9-42ec889c4c77",["D",1785007373549],[180,184,185,186,187,188],[165],"1d020e19-c99a-4598-9450-15318c69110c","store.ts","527da93e-885e-11f1-8e70-1607ee4eb77e","e4669e36-b274-4ce7-85ee-4029b751b8d7",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",[],[285,277],"backend","cf32c54e-5de0-4ea5-b788-9615748feb29","generatePuzzle.ts","4d68b04c-885e-11f1-ba79-1607ee4eb77e",5,["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",[],[285,287],"7ba34d46-11c0-4f85-bf6d-de4a1cca9758",["D",1785007403208],[177,178],[285],["D",1785006829408],["D",1789474235934],{"_11":12,"_133":70},{"_11":12,"_128":129,"_69":70,"_30":68,"_130":131,"_132":24},{"_39":119,"_13":16,"_33":36,"_120":80,"_121":-5,"_122":-5,"_123":-5,"_124":-5,"_125":-5,"_126":14,"_127":12},"ctx",{"_53":-5,"_152":336,"_337":338,"_339":340,"_341":24,"_342":24,"_343":24,"_344":93,"_345":-5,"_346":-7,"_347":-7,"_348":26,"_349":24,"_350":24,"_351":-5,"_352":24,"_353":24,"_354":24,"_355":-5},"ENV",{"_307":308,"_309":310,"_311":16,"_312":313,"_314":315,"_316":317,"_318":319,"_320":321,"_322":323,"_324":325,"_326":327,"_328":329,"_330":331,"_332":333,"_334":335},"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"]

History · index.html