[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_226":227,"_228":229},"routes/_app.x.$handle.$name",{"_102":101,"_32":51,"_110":92,"_27":111,"_13":14,"_112":-5,"_11":113,"_114":115,"_116":117,"_118":119,"_120":121,"_21":-5,"_122":-5,"_123":-5,"_124":25,"_125":126,"_127":25,"_128":-5,"_129":-5,"_130":131},"routes/_app.x.$handle.$name.branch.$branch.version.$version.diff",{"_11":12,"_13":14,"_15":16,"_17":-5,"_18":-5},"project",{"_49":50,"_32":51,"_37":52,"_53":-5,"_54":25,"_55":56,"_57":56,"_58":-5,"_59":-5,"_18":60,"_61":62,"_63":64,"_65":64,"_66":-5,"_67":68,"_69":70,"_71":-5,"_72":-5,"_73":-5,"_74":-5,"_75":76,"_77":76,"_78":79,"_80":79,"_81":79,"_82":76,"_83":76,"_84":85,"_86":87,"_88":89,"_90":25},"version",5,"changes",[19,20],"aiChatInfo","userId",{"_21":42,"_23":-7,"_24":25,"_26":25,"_27":43,"_29":43},{"_21":22,"_23":-7,"_24":25,"_26":25,"_27":28,"_29":28},"file",{"_30":31,"_32":33,"_34":35,"_36":-5,"_37":38,"_39":14,"_40":41,"_24":25},"previous","deleted",false,"deletedHere","path","backend/maze","latestPath","fileId","a1029839-1c87-4be4-8c5d-0773f33c8b98","name","maze","fileType","directory","content","createdAt",["D",1747782143143],"branchVersion","branchId","f290e128-35cd-11f0-9b77-9e149126039e",{"_30":44,"_32":45,"_34":46,"_36":47,"_37":48,"_39":14,"_40":41,"_24":25},"backend/maze/generator.ts","7d603bf0-35ce-11f0-9524-9e149126039e","generator.ts","script","import { Cell, CellType, Difficulty, Maze, MazeAlgorithm } from \"../../shared/types.ts\";\n\n// Initialize an empty grid with walls\nfunction initializeGrid(width: number, height: number): Cell[][] {\n const grid: Cell[][] = [];\n \n for (let y = 0; y < height; y++) {\n const row: Cell[] = [];\n for (let x = 0; x < width; x++) {\n row.push({ type: CellType.WALL, x, y });\n }\n grid.push(row);\n }\n \n return grid;\n}\n\n// Generate a maze using recursive backtracking (DFS)\nfunction generateRecursiveBacktracking(width: number, height: number, difficulty: Difficulty): Cell[][] {\n // Ensure odd dimensions for proper maze generation\n const actualWidth = width % 2 === 0 ? width + 1 : width;\n const actualHeight = height % 2 === 0 ? height + 1 : height;\n \n const grid = initializeGrid(actualWidth, actualHeight);\n \n // Start at a random odd position\n const startX = 1;\n const startY = 1;\n grid[startY][startX].type = CellType.PATH;\n \n const stack: [number, number][] = [[startX, startY]];\n \n // Directions: [dx, dy]\n const directions = [\n [0, -2], // Up\n [2, 0], // Right\n [0, 2], // Down\n [-2, 0] // Left\n ];\n \n while (stack.length > 0) {\n const [currentX, currentY] = stack[stack.length - 1];\n \n // Get unvisited neighbors\n const neighbors: [number, number][] = [];\n \n for (const [dx, dy] of directions) {\n const newX = currentX + dx;\n const newY = currentY + dy;\n \n if (\n newX > 0 && newX < actualWidth - 1 &&\n newY > 0 && newY < actualHeight - 1 &&\n grid[newY][newX].type === CellType.WALL\n ) {\n neighbors.push([newX, newY]);\n }\n }\n \n if (neighbors.length > 0) {\n // Choose a random neighbor\n const [nextX, nextY] = neighbors[Math.floor(Math.random() * neighbors.length)];\n \n // Carve a path to the neighbor\n grid[nextY][nextX].type = CellType.PATH;\n \n // Carve the wall between current and neighbor\n grid[(currentY + nextY) / 2][(currentX + nextX) / 2].type = CellType.PATH;\n \n // Push the neighbor to the stack\n stack.push([nextX, nextY]);\n } else {\n // Backtrack\n stack.pop();\n }\n }\n \n // Add some random paths based on difficulty to make it easier/harder\n const pathModifier = difficulty === Difficulty.EASY ? 0.1 : \n difficulty === Difficulty.MEDIUM ? 0.05 : 0.02;\n \n for (let y = 1; y < actualHeight - 1; y += 2) {\n for (let x = 1; x < actualWidth - 1; x += 2) {\n if (Math.random() < pathModifier && grid[y][x].type === CellType.WALL) {\n grid[y][x].type = CellType.PATH;\n }\n }\n }\n \n return grid;\n}\n\n// Generate a maze using Kruskal's algorithm\nfunction generateKruskal(width: number, height: number, difficulty: Difficulty): Cell[][] {\n // Ensure odd dimensions for proper maze generation\n const actualWidth = width % 2 === 0 ? width + 1 : width;\n const actualHeight = height % 2 === 0 ? height + 1 : height;\n \n const grid = initializeGrid(actualWidth, actualHeight);\n \n // Create cells at odd coordinates\n const cells: { x: number; y: number; set: number }[] = [];\n let setCounter = 0;\n \n for (let y = 1; y < actualHeight - 1; y += 2) {\n for (let x = 1; x < actualWidth - 1; x += 2) {\n grid[y][x].type = CellType.PATH;\n cells.push({ x, y, set: setCounter++ });\n }\n }\n \n // Create walls between cells\n const walls: { x: number; y: number; cell1: number; cell2: number }[] = [];\n \n for (let i = 0; i < cells.length; i++) {\n const { x, y } = cells[i];\n \n // Right wall\n if (x + 2 < actualWidth - 1) {\n const rightCellIndex = cells.findIndex(cell => cell.x === x + 2 && cell.y === y);\n if (rightCellIndex !== -1) {\n walls.push({ x: x + 1, y, cell1: i, cell2: rightCellIndex });\n }\n }\n \n // Bottom wall\n if (y + 2 < actualHeight - 1) {\n const bottomCellIndex = cells.findIndex(cell => cell.x === x && cell.y === y + 2);\n if (bottomCellIndex !== -1) {\n walls.push({ x, y: y + 1, cell1: i, cell2: bottomCellIndex });\n }\n }\n }\n \n // Shuffle walls\n for (let i = walls.length - 1; i > 0; i--) {\n const j = Math.floor(Math.random() * (i + 1));\n [walls[i], walls[j]] = [walls[j], walls[i]];\n }\n \n // Process walls\n for (const wall of walls) {\n const { x, y, cell1, cell2 } = wall;\n \n if (cells[cell1].set !== cells[cell2].set) {\n // Remove the wall\n grid[y][x].type = CellType.PATH;\n \n // Merge sets\n const oldSet = cells[cell2].set;\n const newSet = cells[cell1].set;\n \n for (const cell of cells) {\n if (cell.set === oldSet) {\n cell.set = newSet;\n }\n }\n }\n }\n \n // Add some random paths based on difficulty\n const pathModifier = difficulty === Difficulty.EASY ? 0.15 : \n difficulty === Difficulty.MEDIUM ? 0.08 : 0.03;\n \n for (let y = 1; y < actualHeight - 1; y++) {\n for (let x = 1; x < actualWidth - 1; x++) {\n if (Math.random() < pathModifier && grid[y][x].type === CellType.WALL) {\n grid[y][x].type = CellType.PATH;\n }\n }\n }\n \n return grid;\n}\n\n// Generate a maze using Prim's algorithm\nfunction generatePrim(width: number, height: number, difficulty: Difficulty): Cell[][] {\n // Ensure odd dimensions for proper maze generation\n const actualWidth = width % 2 === 0 ? width + 1 : width;\n const actualHeight = height % 2 === 0 ? height + 1 : height;\n \n const grid = initializeGrid(actualWidth, actualHeight);\n \n // Start with a random cell\n const startX = 1;\n const startY = 1;\n grid[startY][startX].type = CellType.PATH;\n \n // Add walls of the starting cell to the wall list\n const walls: [number, number][] = [\n [startX + 1, startY],\n [startX, startY + 1]\n ];\n \n while (walls.length > 0) {\n // Pick a random wall\n const randomIndex = Math.floor(Math.random() * walls.length);\n const [wallX, wallY] = walls[randomIndex];\n walls.splice(randomIndex, 1);\n \n // Check if the wall connects a path cell and a wall cell\n const neighbors: [number, number][] = [\n [wallX - 1, wallY], // Left\n [wallX + 1, wallY], // Right\n [wallX, wallY - 1], // Up\n [wallX, wallY + 1] // Down\n ];\n \n let pathCount = 0;\n for (const [nx, ny] of neighbors) {\n if (\n nx >= 0 && nx < actualWidth &&\n ny >= 0 && ny < actualHeight &&\n grid[ny][nx].type === CellType.PATH\n ) {\n pathCount++;\n }\n }\n \n // If the wall connects exactly one path cell, remove it\n if (pathCount === 1) {\n grid[wallY][wallX].type = CellType.PATH;\n \n // Add neighboring walls to the wall list\n for (const [nx, ny] of neighbors) {\n if (\n nx >= 1 && nx < actualWidth - 1 &&\n ny >= 1 && ny < actualHeight - 1 &&\n grid[ny][nx].type === CellType.WALL\n ) {\n // Check if this is a valid wall (between cells)\n const isValidWall = (\n (nx % 2 === 1 && ny % 2 === 0) || \n (nx % 2 === 0 && ny % 2 === 1)\n );\n \n if (isValidWall && !walls.some(([x, y]) => x === nx && y === ny)) {\n walls.push([nx, ny]);\n }\n }\n }\n }\n }\n \n // Add some random paths based on difficulty\n const pathModifier = difficulty === Difficulty.EASY ? 0.12 : \n difficulty === Difficulty.MEDIUM ? 0.06 : 0.02;\n \n for (let y = 1; y < actualHeight - 1; y++) {\n for (let x = 1; x < actualWidth - 1; x++) {\n if (Math.random() < pathModifier && grid[y][x].type === CellType.WALL) {\n grid[y][x].type = CellType.PATH;\n }\n }\n }\n \n return grid;\n}\n\n// Find a valid start and end position that are far apart\nfunction findStartAndEndPositions(grid: Cell[][]): { \n startPosition: { x: number; y: number }; \n endPosition: { x: number; y: number }; \n} {\n const height = grid.length;\n const width = grid[0].length;\n \n // Find all path cells\n const pathCells: { x: number; y: number }[] = [];\n \n for (let y = 0; y < height; y++) {\n for (let x = 0; x < width; x++) {\n if (grid[y][x].type === CellType.PATH) {\n pathCells.push({ x, y });\n }\n }\n }\n \n // Choose start position from the left side\n const leftSideCells = pathCells.filter(cell => cell.x < width / 3);\n const startPosition = leftSideCells[Math.floor(Math.random() * leftSideCells.length)];\n \n // Choose end position from the right side\n const rightSideCells = pathCells.filter(\n cell => cell.x > (width * 2) / 3 && \n Math.abs(cell.y - startPosition.y) > height / 3\n );\n const endPosition = rightSideCells[Math.floor(Math.random() * rightSideCells.length)];\n \n // Set cell types\n grid[startPosition.y][startPosition.x].type = CellType.START;\n grid[endPosition.y][endPosition.x].type = CellType.END;\n \n return { startPosition, endPosition };\n}\n\n// Generate a maze based on the specified algorithm, size, and difficulty\nexport function generateMaze(\n name: string,\n algorithm: MazeAlgorithm,\n width: number,\n height: number,\n difficulty: Difficulty\n): Maze {\n // Ensure minimum size\n const actualWidth = Math.max(width, 5);\n const actualHeight = Math.max(height, 5);\n \n let grid: Cell[][];\n \n // Generate maze based on algorithm\n switch (algorithm) {\n case MazeAlgorithm.RECURSIVE_BACKTRACKING:\n grid = generateRecursiveBacktracking(actualWidth, actualHeight, difficulty);\n break;\n case MazeAlgorithm.KRUSKAL:\n grid = generateKruskal(actualWidth, actualHeight, difficulty);\n break;\n case MazeAlgorithm.PRIM:\n grid = generatePrim(actualWidth, actualHeight, difficulty);\n break;\n default:\n grid = generateRecursiveBacktracking(actualWidth, actualHeight, difficulty);\n }\n \n // Find start and end positions\n const { startPosition, endPosition } = findStartAndEndPositions(grid);\n \n return {\n name,\n algorithm,\n difficulty,\n width: actualWidth,\n height: actualHeight,\n grid,\n startPosition,\n endPosition\n };\n}",["D",1747782143143],"id","f290afaa-35cd-11f0-9b77-9e149126039e","a-mazing-maze-days",["D",1747781910261],"deletedAt","legacyEnvVars","privacy","public","httpPrivacy","description","imageUrl","1167e096-63d9-481f-b740-997fcea83426","pinnedFileId","9274de56-35ce-11f0-ab4f-9e149126039e","pinPreview",true,"pinMigrated","screenshotVersion","likeCount",0,"orgId","8433e007-847e-4c91-8408-c94f14e035f8","tursoName","tursoHostname","tursoMeasuredAt","pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm","user",{"_102":101,"_109":105},"org",{"_102":101,"_103":-5,"_104":105,"_18":60,"_106":107,"_108":25},"branch",{"_13":91,"_32":92,"_49":41,"_93":50,"_94":-5,"_95":-5,"_96":-5,"_97":-5,"_98":-5,"_99":51,"_100":101},"isOwned",28,"main","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","dthyresson","handle","displayName","avatar","https://img.clerk.com/eyJ0eXBlIjoicHJveHkiLCJzcmMiOiJodHRwczovL2ltYWdlcy5jbGVyay5kZXYvb2F1dGhfZ2l0aHViL2ltZ18yY2VObmZYclBVbjhpdnlQQkROeEIycWViSTYifQ","tier","pro","canRestrictVals","profileImageUrl","branchName","","adoptOrgId",{"_49":50,"_32":51,"_37":222,"_53":-5,"_54":25,"_55":56,"_57":56,"_58":-5,"_59":-5,"_18":60,"_61":62,"_63":64,"_65":64,"_66":-5,"_67":68,"_69":70,"_71":-5,"_72":-5,"_73":-5,"_74":-5,"_75":76,"_77":76,"_78":79,"_80":79,"_81":79,"_82":76,"_83":76,"_84":223,"_86":224,"_88":225,"_90":25},"tree",[167,173,175],"files",[167,168,169,170,171,172,173,174,175],"counts",{"_157":139,"_158":148,"_159":68,"_160":161,"_162":163},"contents",[132,133,134],"upstreamProject","upstreamBranch","emptyEnvVars","flags",[],"hasHttpFiles","grants","orgs","customDomains",{},{"_49":151,"_32":152,"_30":153,"_138":-5,"_40":41,"_39":154,"_140":64,"_37":155,"_13":68,"_34":35,"_36":-5,"_24":25,"_143":-5,"_27":156},{"_49":145,"_32":146,"_30":147,"_138":-5,"_40":41,"_39":148,"_140":64,"_37":149,"_13":68,"_34":35,"_36":-5,"_24":25,"_143":-5,"_27":150},{"_49":135,"_32":136,"_30":137,"_138":-5,"_40":41,"_39":139,"_140":25,"_37":141,"_13":68,"_34":21,"_36":142,"_24":25,"_143":-5,"_27":144},"4f93facc-35ce-11f0-a397-9e149126039e","README.md","4f93fb76-35ce-11f0-a397-9e149126039e","parentId",1,"latest",["D",1747782066308],"# A-Mazing Maze Days\n\nA fun maze builder and player application that lets you create, play, save, and share mazes of various types and difficulty levels.\n\n## Features\n\n- Create mazes with different algorithms (Recursive Backtracking, Kruskal's, Prim's)\n- Customize maze size and difficulty\n- Play through mazes with keyboard or touch controls\n- Celebrate when you reach the goal\n- Save your favorite mazes to play again later\n- Share mazes with friends\n- Browse a gallery of your created mazes\n\n## Project Structure\n\n- `/backend` - Server-side code for maze generation, storage, and API\n- `/frontend` - Client-side code for UI, maze rendering, and player controls\n- `/shared` - Shared types and utilities\n\n## Technologies\n\n- Frontend: React with Tailwind CSS\n- Backend: Hono API framework\n- Storage: SQLite database\n- Maze Generation: Custom algorithms\n\n## How to Use\n\n1. Visit the app\n2. Create a new maze by selecting an algorithm, size, and difficulty\n3. Play through the maze using arrow keys or touch controls\n4. Save your maze when complete\n5. View your saved mazes in the gallery\n6. Share mazes with friends using the share button\n\nEnjoy your maze adventures!","label",[136],"55f5477c-35ce-11f0-97a5-9e149126039e","shared","1624aed8-8771-4468-b82b-97267ad1a7ef",2,["D",1747782077010],[146],"59fa0c36-35ce-11f0-9dbf-9e149126039e","backend","c6e61b8a-b2bb-40ef-bf63-ed8dabed1224",3,["D",1747782083753],[152],"pulls","branches","forks","envVars",{"_164":68,"_166":68},"connections",{"_164":68,"_165":68},"count","unfilledCount","emptyCount",{"_49":151,"_32":152,"_30":153,"_138":-5,"_40":41,"_39":154,"_140":64,"_37":219,"_13":68,"_34":35,"_36":-5,"_24":25,"_143":-5,"_177":220,"_27":221},{"_49":215,"_32":207,"_30":201,"_138":153,"_40":41,"_39":154,"_140":64,"_37":216,"_13":68,"_34":35,"_36":-5,"_24":25,"_143":-5,"_177":217,"_27":218},{"_49":208,"_32":209,"_30":210,"_138":201,"_40":41,"_39":154,"_140":25,"_37":211,"_13":68,"_34":46,"_36":212,"_24":25,"_143":-5,"_177":213,"_27":214},{"_49":198,"_32":199,"_30":200,"_138":201,"_40":41,"_39":202,"_140":25,"_37":203,"_13":68,"_34":46,"_36":204,"_24":25,"_143":-5,"_177":205,"_27":206},{"_49":194,"_32":33,"_30":31,"_138":153,"_40":41,"_39":14,"_140":64,"_37":195,"_13":68,"_34":35,"_36":-5,"_24":25,"_143":-5,"_177":196,"_27":197},{"_49":190,"_32":45,"_30":44,"_138":31,"_40":41,"_39":14,"_140":64,"_37":191,"_13":68,"_34":46,"_36":47,"_24":25,"_143":-5,"_177":192,"_27":193},{"_49":145,"_32":146,"_30":147,"_138":-5,"_40":41,"_39":148,"_140":64,"_37":187,"_13":68,"_34":35,"_36":-5,"_24":25,"_143":-5,"_177":188,"_27":189},{"_49":180,"_32":181,"_30":182,"_138":147,"_40":41,"_39":148,"_140":25,"_37":183,"_13":68,"_34":46,"_36":184,"_24":25,"_143":-5,"_177":185,"_27":186},{"_49":135,"_32":136,"_30":137,"_138":-5,"_40":41,"_39":139,"_140":25,"_37":176,"_13":68,"_34":21,"_36":142,"_24":25,"_143":-5,"_177":178,"_27":179},["D",1747782066308],"children",[],[136],"55f53e30-35ce-11f0-97a5-9e149126039e","types.ts","55f53f02-35ce-11f0-97a5-9e149126039e",["D",1747782077010],"// Maze cell types\nexport enum CellType {\n WALL = \"wall\",\n PATH = \"path\",\n START = \"start\",\n END = \"end\",\n CURRENT = \"current\",\n VISITED = \"visited\",\n}\n\n// Maze generation algorithms\nexport enum MazeAlgorithm {\n RECURSIVE_BACKTRACKING = \"recursive_backtracking\",\n KRUSKAL = \"kruskal\",\n PRIM = \"prim\",\n}\n\n// Difficulty levels\nexport enum Difficulty {\n EASY = \"easy\",\n MEDIUM = \"medium\",\n HARD = \"hard\",\n}\n\n// Direction for movement\nexport enum Direction {\n UP = \"up\",\n RIGHT = \"right\",\n DOWN = \"down\",\n LEFT = \"left\",\n}\n\n// Maze cell representation\nexport interface Cell {\n type: CellType;\n x: number;\n y: number;\n}\n\n// Maze data structure\nexport interface Maze {\n id?: number;\n name: string;\n algorithm: MazeAlgorithm;\n difficulty: Difficulty;\n width: number;\n height: number;\n grid: Cell[][];\n startPosition: { x: number; y: number };\n endPosition: { x: number; y: number };\n createdAt?: string;\n userId?: string;\n}\n\n// Saved maze in database\nexport interface SavedMaze {\n id: number;\n name: string;\n algorithm: string;\n difficulty: string;\n width: number;\n height: number;\n gridData: string; // JSON string of the grid\n startX: number;\n startY: number;\n endX: number;\n endY: number;\n createdAt: string;\n userId: string;\n}\n\n// API response for maze list\nexport interface MazeListResponse {\n mazes: SavedMaze[];\n}\n\n// API response for a single maze\nexport interface MazeResponse {\n maze: SavedMaze;\n}",[],[146,181],["D",1747782077010],[174],[146],"7d603b1e-35ce-11f0-9524-9e149126039e",["D",1747782143143],[],[152,33,45],"7d606d82-35ce-11f0-9524-9e149126039e",["D",1747782143143],[172],[152,33],"5fe6e862-35ce-11f0-96dd-9e149126039e","queries.ts","5fe6e90c-35ce-11f0-96dd-9e149126039e","7cb14911-7745-49f4-b57f-1e77be7a4d44",4,["D",1747782093696],"import { sqlite } from \"https://esm.town/v/stevekrouse/sqlite\";\nimport { MAZES_TABLE } from \"./migrations.ts\";\nimport { Maze, SavedMaze } from \"../../shared/types.ts\";\n\n// Save a maze to the database\nexport async function saveMaze(maze: Maze, userId: string): Promise {\n const createdAt = new Date().toISOString();\n const gridData = JSON.stringify(maze.grid);\n \n const result = await sqlite.execute(\n `INSERT INTO ${MAZES_TABLE} (\n name, algorithm, difficulty, width, height, gridData, \n startX, startY, endX, endY, createdAt, userId\n ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n RETURNING id`,\n [\n maze.name,\n maze.algorithm,\n maze.difficulty,\n maze.width,\n maze.height,\n gridData,\n maze.startPosition.x,\n maze.startPosition.y,\n maze.endPosition.x,\n maze.endPosition.y,\n createdAt,\n userId\n ]\n );\n \n return result.rows[0].id;\n}\n\n// Get all mazes for a user\nexport async function getMazesByUser(userId: string): Promise {\n const result = await sqlite.execute(\n `SELECT * FROM ${MAZES_TABLE} WHERE userId = ? ORDER BY createdAt DESC`,\n [userId]\n );\n \n return result.rows as SavedMaze[];\n}\n\n// Get a specific maze by ID\nexport async function getMazeById(id: number): Promise {\n const result = await sqlite.execute(\n `SELECT * FROM ${MAZES_TABLE} WHERE id = ?`,\n [id]\n );\n \n if (result.rows.length === 0) {\n return null;\n }\n \n return result.rows[0] as SavedMaze;\n}\n\n// Delete a maze by ID\nexport async function deleteMaze(id: number, userId: string): Promise {\n const result = await sqlite.execute(\n `DELETE FROM ${MAZES_TABLE} WHERE id = ? AND userId = ?`,\n [id, userId]\n );\n \n return result.rowsAffected > 0;\n}",[],[152,207,199],"database","59fa0420-35ce-11f0-9dbf-9e149126039e","migrations.ts","59fa04d4-35ce-11f0-9dbf-9e149126039e",["D",1747782083753],"import { sqlite } from \"https://esm.town/v/stevekrouse/sqlite\";\n\n// Table name for mazes\nexport const MAZES_TABLE = \"amazing_mazes\";\n\n// Initialize the database with required tables\nexport async function initializeDatabase() {\n // Create mazes table\n await sqlite.execute(`\n CREATE TABLE IF NOT EXISTS ${MAZES_TABLE} (\n id INTEGER PRIMARY KEY AUTOINCREMENT,\n name TEXT NOT NULL,\n algorithm TEXT NOT NULL,\n difficulty TEXT NOT NULL,\n width INTEGER NOT NULL,\n height INTEGER NOT NULL,\n gridData TEXT NOT NULL,\n startX INTEGER NOT NULL,\n startY INTEGER NOT NULL,\n endX INTEGER NOT NULL,\n endY INTEGER NOT NULL,\n createdAt TEXT NOT NULL,\n userId TEXT NOT NULL\n )\n `);\n \n console.log(\"Database initialized successfully\");\n}",[],[152,207,209],"59fa0dc6-35ce-11f0-9dbf-9e149126039e",["D",1747782083753],[169,170],[152,207],["D",1747782083753],[168,171],[152],["D",1747781910261],{"_102":101,"_109":105},{"_102":101,"_103":-5,"_104":105,"_18":60,"_106":107,"_108":25},{"_13":91,"_32":92,"_49":41,"_93":50,"_94":-5,"_95":-5,"_96":-5,"_97":-5,"_98":-5,"_99":51,"_100":101},"ctx",{"_84":-5,"_129":259,"_260":261,"_262":263,"_264":25,"_265":25,"_266":25,"_267":64,"_268":-5,"_269":-7,"_270":-7,"_271":68,"_272":25,"_273":25,"_274":-5,"_275":25,"_276":25,"_277":25,"_278":-5},"ENV",{"_230":231,"_232":233,"_234":92,"_235":236,"_237":238,"_239":240,"_241":242,"_243":244,"_245":246,"_247":248,"_249":250,"_251":252,"_253":254,"_255":256,"_257":258},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","71c1b20804b3232a7e513be260cfffc1932a9e97","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 · v5