Hi

\"\n});\n```\n\n## Val Town Utility Functions\n\nVal Town provides several utility functions to help with common project tasks.\n\n### Importing Utilities\n\nAlways import utilities with version pins to avoid breaking changes:\n\n```ts\nimport { parseProject, readFile, serveFile } from \"https://esm.town/v/std/utils@85-main/index.ts\";\n```\n\n### Available Utilities\n\n\n#### **serveFile** - Serve project files with proper content types\n\nFor example, in Hono:\n\n```ts\n// serve all files in frontend/ and shared/\napp.get(\"/frontend/*\", c => serveFile(c.req.path, import.meta.url));\napp.get(\"/shared/*\", c => serveFile(c.req.path, import.meta.url));\n```\n\n#### **readFile** - Read files from within the project:\n\n```ts\n// Read a file from the project\nconst fileContent = await readFile(\"/frontend/index.html\", import.meta.url);\n```\n\n#### **listFiles** - List all files in the project\n\n```ts\nconst files = await listFiles(import.meta.url);\n```\n\n#### **parseProject** - Extract information about the current project from import.meta.url\n\nThis is useful for including info for linking back to a val, ie in \"view source\" urls:\n\n```ts\nconst projectVal = parseProject(import.meta.url);\nconsole.log(projectVal.username); // Owner of the project\nconsole.log(projectVal.name); // Project name\nconsole.log(projectVal.version); // Version number\nconsole.log(projectVal.branch); // Branch name\nconsole.log(projectVal.links.self.project); // URL to the project page\n```\n\nHowever, it's *extremely importing* to note that `parseProject` and other Standard Library utilities ONLY RUN ON THE SERVER.\nIf you need access to this data on the client, run it in the server and pass it to the client by splicing it into the HTML page\nor by making an API request for it.\n\n## Val Town Platform Specifics\n\n- **Redirects:** Use `return new Response(null, { status: 302, headers: { Location: \"/place/to/redirect\" }})` instead of `Response.redirect` which is broken\n- **Images:** Avoid external images or base64 images. Use emojis, unicode symbols, or icon fonts/libraries instead\n- **AI Image:** To inline generate an AI image use: `

`\n- **Storage:** DO NOT use the Deno KV module for storage\n- **Browser APIs:** DO NOT use the `alert()`, `prompt()`, or `confirm()` methods\n- **Weather Data:** Use open-meteo for weather data (doesn't require API keys) unless otherwise specified\n- **View Source:** Add a view source link by importing & using `import.meta.url.replace(\"ems.sh\", \"val.town)\"` (or passing this data to the client) and include `target=\"_top\"` attribute\n- **Error Debugging:** Add `` to HTML to capture client-side errors\n- **Error Handling:** Only use try...catch when there's a clear local resolution; Avoid catches that merely log or return 500s. Let errors bubble up with full context\n- **Environment Variables:** Use `Deno.env.get('keyname')` when you need to, but generally prefer APIs that don't require keys\n- **Imports:** Use `https://esm.sh` for npm and Deno dependencies to ensure compatibility on server and browser\n- **Storage Strategy:** Only use backend storage if explicitly required; prefer simple static client-side sites\n- **React Configuration:** When using React libraries, pin versions with `?deps=react@18.2.0,react-dom@18.2.0` and start the file with `/** @jsxImportSource https://esm.sh/react@18.2.0 */`\n- Ensure all React dependencies and sub-dependencies are pinned to the same version\n- **Styling:** Default to using TailwindCSS via `` unless otherwise specified\n\n## Project Structure and Design Patterns\n\n### Recommended Directory Structure\n```\n├── backend/\n│ ├── database/\n│ │ ├── migrations.ts # Schema definitions\n│ │ ├── queries.ts # DB query functions\n│ │ └── README.md\n│ └── routes/ # Route modules\n│ ├── [route].ts\n│ └── static.ts # Static file serving\n│ ├── index.ts # Main entry point\n│ └── README.md\n├── frontend/\n│ ├── components/\n│ │ ├── App.tsx\n│ │ └── [Component].tsx\n│ ├── favicon.svg\n│ ├── index.html # Main HTML template\n│ ├── index.tsx # Frontend JS entry point\n│ ├── README.md\n│ └── style.css\n├── README.md\n└── shared/\n ├── README.md\n └── utils.ts # Shared types and functions\n```\n\n### Backend (Hono) Best Practices\n\n- Hono is the recommended API framework\n- Main entry point should be `backend/index.ts`\n- **Static asset serving:** Use the utility functions to read and serve project files:\n ```ts\n import { readFile, serveFile } from \"https://esm.town/v/std/utils@85-main/index.ts\";\n \n // serve all files in frontend/ and shared/\n app.get(\"/frontend/*\", c => serveFile(c.req.path, import.meta.url));\n app.get(\"/shared/*\", c => serveFile(c.req.path, import.meta.url));\n \n // For index.html, often you'll want to bootstrap with initial data\n app.get(\"/\", async c => {\n let html = await readFile(\"/frontend/index.html\", import.meta.url);\n \n // Inject data to avoid extra round-trips\n const initialData = await fetchInitialData();\n const dataScript = ``;\n \n html = html.replace(\"\", `${dataScript}`);\n return c.html(html);\n });\n ```\n- Create RESTful API routes for CRUD operations\n- Always include this snippet at the top-level Hono app to re-throwing errors to see full stack traces:\n ```ts\n // Unwrap Hono errors to see original error details\n app.onError((err, c) => {\n throw err;\n });\n ```\n\n### Database Patterns\n- Run migrations on startup or comment out for performance\n- Change table names when modifying schemas rather than altering\n- Export clear query functions with proper TypeScript typing\n\n## Common Gotchas and Solutions\n\n1. **Environment Limitations:** \n - Val Town runs on Deno in a serverless context, not Node.js\n - Code in `shared/` must work in both frontend and backend environments\n - Cannot use `Deno` keyword in shared code\n - Use `https://esm.sh` for imports that work in both environments\n\n2. **SQLite Peculiarities:**\n - Limited support for ALTER TABLE operations\n - Create new tables with updated schemas and copy data when needed\n - Always run table creation before querying\n\n3. **React Configuration:**\n - All React dependencies must be pinned to 18.2.0\n - Always include `@jsxImportSource https://esm.sh/react@18.2.0` at the top of React files\n - Rendering issues often come from mismatched React versions\n\n4. **File Handling:**\n - Val Town only supports text files, not binary\n - Use the provided utilities to read files across branches and forks\n - For files in the project, use `readFile` helpers\n\n5. **API Design:**\n - `fetch` handler is the entry point for HTTP vals\n - Run the Hono app with `export default app.fetch // This is the entry point for HTTP vals`\n\n",[],[172],{"_103":180,"_95":181,"_152":182,"_154":-5,"_155":138,"_156":137,"_158":159,"_105":183,"_100":184,"_161":162,"_163":185,"_165":22,"_166":-5,"_167":186,"_98":187},"7824fa86-ba67-11f0-be7c-0224a6c84d84","README.md","af4ef428-ba65-11f0-8665-0224a6c84d84",["D",1762361400842],7,"# connect4_ai\n\nA parallel connect4 AI player written in a webgpu shader.\n\nDoes a minimax evaluation on the current game state, looking 8 moves ahead at\nall possible game states. Expands the tree out 3 levels which results in 343\ngame states, those are then each evaluated on a gpu thread to check 5 more moves\nahead. All in all it looks at 5,764,801 different game states to make it's\ndecision.\n\n# future work\n\nRuns pretty quickly on an M series mac or on a computer with a good gpu. Can be\nkinda slow if you only have an integrated gpu and probably doesn't work at all\non most phones. I basically just wrote it to work well on my computer, I could\nprobably tune it to run better on the device it's loaded on.\n\nI'm pretty new to gpu programming and I don't think this is really the best\nway to do this. The code is very branchy and it's likely that is slowing things\ndown a lot. Ideally each gpu \"thread\" should run the same instructions since a thread in a gpu is really more like a simd lane. When the threads diverge I think you lose a lot of the throughput.",[],[181],{"_103":189,"_95":190,"_152":191,"_154":-5,"_155":138,"_156":192,"_158":159,"_105":193,"_100":194,"_161":195,"_163":196,"_165":22,"_166":-5,"_167":197,"_98":198},"18882c1e-b900-11f0-8b8e-0224a6c84d84","connect4_ai.js","b6429a8a-b5da-11f0-b8e8-0224a6c84d84",1200,["D",1762207051101],179,"script","// Setup compute pipeline.\nconst shader = await (await fetch(\"connect4_ai.wgsl\")).text();\n\nconst adapter = await navigator.gpu.requestAdapter();\nconst maybe_device = await adapter.requestDevice();\nif (!maybe_device) {\n fail(\"Browser does not support WebGPU\");\n}\nconst device = maybe_device;\n\nconst module = device.createShaderModule({\n label: \"Connect4 AI Shader Module\",\n code: shader,\n});\n\nconst bind_group_layout = device.createBindGroupLayout({\n label: \"Connect4 AI Bind Group Layout\",\n entries: [\n {\n binding: 0,\n visibility: GPUShaderStage.COMPUTE,\n buffer: {\n type: \"storage\",\n },\n },\n {\n binding: 1,\n visibility: GPUShaderStage.COMPUTE,\n buffer: {\n type: \"storage\",\n },\n },\n ],\n});\n\nconst pipeline = device.createComputePipeline({\n label: \"Connect4 AI Compute Pipeline\",\n layout: device.createPipelineLayout({\n label: \"Connect4 AI Pipeline Layout\",\n bindGroupLayouts: [bind_group_layout],\n }),\n compute: {\n module: module,\n entryPoint: \"main\",\n },\n});\n\nconst input_values = new ArrayBuffer(68);\nconst input_views = {\n red_cols: new Uint32Array(input_values, 0, 7),\n yellow_cols: new Uint32Array(input_values, 28, 7),\n current_player: new Uint32Array(input_values, 56, 1),\n in_progress: new Uint32Array(input_values, 60, 1),\n winning_player: new Uint32Array(input_values, 64, 1),\n};\n\nconst input_buffer = device.createBuffer({\n label: \"Input Buffer\",\n size: input_values.byteLength,\n usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST,\n});\n\nconst output_size = Float32Array.BYTES_PER_ELEMENT * 7;\nconst output_buffer = device.createBuffer({\n label: \"Output Buffer\",\n size: output_size,\n usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC,\n});\nconst output_read_buffer = device.createBuffer({\n label: \"Output Read Buffer\",\n size: output_size,\n usage: GPUBufferUsage.MAP_READ | GPUBufferUsage.COPY_DST,\n});\n\nconst bind_group = device.createBindGroup({\n label: \"Bind Group\",\n layout: pipeline.getBindGroupLayout(0),\n entries: [\n {\n binding: 0,\n resource: {\n buffer: input_buffer,\n },\n },\n {\n binding: 1,\n resource: {\n buffer: output_buffer,\n },\n },\n ],\n});\n\nasync function connect4_ai_best_action(valid_action) {\n const encoder = device.createCommandEncoder(\n {\n label: \"Connect4 AI Command Encoder\",\n }\n );\n\n const pass = encoder.beginComputePass({\n label: \"Connect4 AI Compute Pass\",\n });\n pass.setPipeline(pipeline);\n pass.setBindGroup(0, bind_group);\n pass.dispatchWorkgroups(7);\n pass.end();\n\n // Copy output to our readable buffer.\n encoder.copyBufferToBuffer(\n output_buffer,\n 0,\n output_read_buffer,\n 0,\n output_size\n );\n\n const command_buffer = encoder.finish();\n\n device.queue.writeBuffer(input_buffer, 0, input_values);\n device.queue.submit([command_buffer]);\n\n await output_read_buffer.mapAsync(GPUMapMode.READ);\n const result = new Float32Array(output_read_buffer.getMappedRange());\n\n console.log(\"action_scores\", result);\n let best_action = -1;\n let best_score = -Infinity;\n for (let c = 0; c < 7; c++) {\n if (valid_action[c]) {\n const score = result[c];\n if (score > best_score) {\n best_score = score;\n best_action = c;\n }\n }\n }\n console.assert(best_action >= 0, \"AI could not find a valid action\");\n\n output_read_buffer.unmap();\n return best_action;\n}\n\nasync function warmupAI() {\n input_views.red_cols.fill(0);\n input_views.yellow_cols.fill(0);\n input_views.current_player.set([1]);\n input_views.in_progress.set([1]);\n input_views.winning_player.set([0]);\n\n try {\n await connect4_ai_best_action([true,true,true,true,true,true,true]);\n } catch (err) {\n console.error(\"Connect4 AI warmup failed:\", err);\n throw err;\n }\n}\n\nself.onmessage = (e) => {\n const data = e.data;\n if (data.kind == 'ai_turn' && data.input) {\n console.log('Running AI turn with input:', data.input);\n\n const {board, current_player} = data.input;\n console.log(data.input);\n\n let valid_action = [false,false,false,false,false,false,false];\n\n let red_cols = new Uint32Array(7);\n let yellow_cols = new Uint32Array(7);\n for (let c = 0; c < 7; c++) {\n let red_col = 0;\n let yellow_col = 0;\n for (let r = 0; r < 6; r++) {\n const cell = board[r][c];\n if (cell == 1) {\n red_col |= (1 << (5-r));\n } else if (cell == 2) {\n yellow_col |= (1 << (5-r));\n } else if (r == 0) {\n valid_action[c] = true;\n }\n }\n red_cols[c] = red_col;\n yellow_cols[c] = yellow_col;\n }\n\n input_views.red_cols.set(red_cols);\n input_views.yellow_cols.set(yellow_cols);\n input_views.current_player.set([current_player]);\n input_views.in_progress.set([1]);\n input_views.winning_player.set([0]);\n\n console.log(valid_action);\n console.log(input_views);\n\n connect4_ai_best_action(valid_action).then((result) => {\n self.postMessage({kind: 'ai_turn_result', result: result});\n });\n } else {\n console.log('AI Worker Response:', data);\n }\n};\n\nwarmupAI()\n .then(() => {\n self.postMessage({kind: 'status', ready: true});\n })\n .catch((err) => {\n self.postMessage({kind: 'status', ready: false, error: err instanceof Error ? err.message : String(err)});\n });\n",[],[190],{"_103":200,"_95":201,"_152":202,"_154":-5,"_155":138,"_156":203,"_158":159,"_105":204,"_100":205,"_161":162,"_163":206,"_165":22,"_166":-5,"_167":207,"_98":208},"5e4b0846-ba65-11f0-9dee-0224a6c84d84","connect4_ai.wgsl","a87a0e22-b901-11f0-9479-0224a6c84d84",1220,["D",1762360498477],5,"const ROWS: u32 = 6;\nconst COLS: u32 = 7;\n\nstruct Connect4State {\n red_cols: array,\n yellow_cols: array,\n current_player: u32,\n in_progress: u32,\n winning_player: u32,\n}\n\nfn connect4_apply_action(current_state: Connect4State, player: u32, action: u32) -> Connect4State {\n var state: Connect4State = current_state;\n for (var row: u32 = 0u; row < ROWS; row = row + 1u) {\n let bit: u32 = 1u << row;\n if (((state.red_cols[action] | state.yellow_cols[action]) & bit) == 0u) {\n if (player == 1u) {\n state.red_cols[action] = state.red_cols[action] | bit;\n } else {\n state.yellow_cols[action] = state.yellow_cols[action] | bit;\n }\n break;\n }\n }\n\n // Check for a win or draw.\n var player_cols: array;\n if (player == 1u) {\n player_cols = state.red_cols;\n } else {\n player_cols = state.yellow_cols;\n };\n\n // Check vertical.\n for (var col: u32 = 0u; col < COLS; col = col + 1u) {\n for (var row: u32 = 0u; row < 3; row = row + 1u) { \n if (((player_cols[col] & (1u << (row + 0u))) != 0u) &&\n ((player_cols[col] & (1u << (row + 1u))) != 0u) &&\n ((player_cols[col] & (1u << (row + 2u))) != 0u) &&\n ((player_cols[col] & (1u << (row + 3u))) != 0u)) {\n state.in_progress = 0u;\n state.winning_player = player;\n return state;\n }\n }\n }\n // Check horizontal.\n for (var col: u32 = 0u; col < 4; col = col + 1u) {\n for (var row: u32 = 0u; row < ROWS; row = row + 1u) {\n if (((player_cols[col + 0u] & (1u << row)) != 0u) &&\n ((player_cols[col + 1u] & (1u << row)) != 0u) &&\n ((player_cols[col + 2u] & (1u << row)) != 0u) &&\n ((player_cols[col + 3u] & (1u << row)) != 0u)) {\n state.in_progress = 0u;\n state.winning_player = player;\n return state;\n }\n }\n }\n // Check diagonal up-right.\n for (var col: u32 = 0u; col < 4; col = col + 1u) {\n for (var row: u32 = 0u; row < 3; row = row + 1u) {\n if (((player_cols[col + 0u] & (1u << (row + 0u))) != 0u) &&\n ((player_cols[col + 1u] & (1u << (row + 1u))) != 0u) &&\n ((player_cols[col + 2u] & (1u << (row + 2u))) != 0u) &&\n ((player_cols[col + 3u] & (1u << (row + 3u))) != 0u)) {\n state.in_progress = 0u;\n state.winning_player = player;\n return state;\n }\n }\n }\n // Check diagonal down-right.\n for (var col: u32 = 0u; col < 4; col = col + 1u) {\n for (var row: u32 = 3u; row < 6; row = row + 1u) {\n if (((player_cols[col + 0u] & (1u << (row - 0u))) != 0u) &&\n ((player_cols[col + 1u] & (1u << (row - 1u))) != 0u) &&\n ((player_cols[col + 2u] & (1u << (row - 2u))) != 0u) &&\n ((player_cols[col + 3u] & (1u << (row - 3u))) != 0u)) {\n state.in_progress = 0u;\n state.winning_player = player;\n return state;\n }\n }\n }\n // Check for possible moves\n for (var col: u32 = 0u; col < COLS; col = col + 1u) {\n if (((state.red_cols[col] | state.yellow_cols[col]) & 0x3Fu) != 0x3Fu) {\n // Found a possible move.\n state.in_progress = 1u;\n state.winning_player = 0u;\n if (player == 1u) {\n state.current_player = 2u;\n } else {\n state.current_player = 1u;\n }\n return state;\n }\n }\n\n // Draw\n state.current_player = 0u;\n state.in_progress = 0u;\n state.winning_player = 0u;\n return state;\n}\n\nconst NODEHEADER_IN_USE_BIT: u32 = 1u << 31u;\nconst NODEHEADER_ACTIONS_MASK: u32 = 0x7Fu;\nconst NODEHEADER_ACTIONS_PUSHED_MASK: u32 = NODEHEADER_ACTIONS_MASK << 8u;\nconst NODEHEADER_ACTIONS_FINISHED_MASK: u32 = NODEHEADER_ACTIONS_MASK << 16u;\n\nfn node_header_actions_get(header: u32) -> u32 {\n return header & NODEHEADER_ACTIONS_MASK;\n}\nfn node_header_actions_set(header: u32, actions: u32) -> u32 {\n return (header & ~NODEHEADER_ACTIONS_MASK) | (actions & NODEHEADER_ACTIONS_MASK);\n}\n\nfn node_header_actions_pushed_get(header: u32) -> u32 {\n return (NODEHEADER_ACTIONS_PUSHED_MASK & header) >> 8u;\n}\nfn node_header_actions_pushed_set(header: u32, actions_pushed: u32) -> u32 {\n return (header & ~NODEHEADER_ACTIONS_PUSHED_MASK) | ((actions_pushed & NODEHEADER_ACTIONS_MASK) << 8u);\n}\n\nfn node_header_actions_finished_get(header: u32) -> u32 {\n return (NODEHEADER_ACTIONS_FINISHED_MASK & header) >> 16u;\n}\nfn node_header_actions_finished_set(header: u32, actions_finished: u32) -> u32 {\n return (header & ~NODEHEADER_ACTIONS_FINISHED_MASK) | ((actions_finished & NODEHEADER_ACTIONS_MASK) << 16u);\n}\n\nstruct StackEntry {\n state: Connect4State,\n actions: array,\n action_scores: array,\n action_count: i32,\n \n parent_node_i: i32,\n parent_action_i: i32,\n last_pushed_child_action_i: i32,\n depth: i32,\n}\n\nfn connect4_minimax(root_state: Connect4State, max_depth: i32) -> f32 {\n var result: f32 = 0.0;\n \n var stack: array;\n var stack_count: u32 = 0u;\n \n var root: StackEntry;\n root.state = root_state;\n root.action_count = 0;\n root.parent_node_i = -1;\n root.parent_action_i = -1;\n root.last_pushed_child_action_i = -1;\n root.depth = 0;\n\n stack[0] = root;\n stack_count = 1;\n\n while(stack_count > 0) {\n let top_i: i32 = i32(stack_count) - 1;\n let top: ptr = &stack[top_i];\n\n if (top.action_count == 0) {\n // Initialize actions.\n for (var col: u32 = 0u; col < COLS; col = col + 1u) {\n // Check if column is full.\n if ((top.state.red_cols[col] | top.state.yellow_cols[col]) == 0x3Fu) {\n continue;\n }\n top.actions[top.action_count] = col;\n top.action_count = top.action_count + 1;\n }\n }\n\n if (top.last_pushed_child_action_i < top.action_count - 1) {\n // Push next child.\n top.last_pushed_child_action_i = top.last_pushed_child_action_i + 1;\n let col: u32 = top.actions[top.last_pushed_child_action_i];\n let child_state: Connect4State = connect4_apply_action(top.state, top.state.current_player, col);\n\n if (child_state.in_progress == 0u || top.depth == max_depth - 1) {\n // Leaf node, score right away.\n var score: f32 = 0.0;\n if (child_state.winning_player == input_data.current_player) {\n score = 1.0;\n } else if (child_state.winning_player != 0u) {\n score = -1.0;\n }\n top.action_scores[top.last_pushed_child_action_i] = score;\n } else {\n // Push child onto stack.\n var child: StackEntry;\n child.state = child_state;\n child.action_count = 0;\n child.parent_node_i = top_i;\n child.parent_action_i = i32(top.last_pushed_child_action_i);\n child.last_pushed_child_action_i = -1;\n child.depth = top.depth + 1;\n\n stack[stack_count] = child;\n stack_count = stack_count + 1;\n }\n } else {\n // Compute score and pop.\n var score: f32;\n if (top.state.current_player == input_data.current_player) {\n score = -1000.0;\n for (var action_i: i32 = 0; action_i < top.action_count; action_i = action_i + 1) {\n score = max(score, top.action_scores[action_i]);\n }\n } else {\n score = 1000.0;\n for (var action_i: i32 = 0; action_i < top.action_count; action_i = action_i + 1) {\n score = min(score, top.action_scores[action_i]);\n }\n }\n\n // Write score to parent.\n if (top.parent_node_i == -1) {\n result = score;\n break;\n } else {\n let parent: ptr = &stack[top.parent_node_i];\n parent.action_scores[top.parent_action_i] = score;\n stack_count = stack_count - 1;\n }\n }\n }\n\n return result;\n}\n\nfn connect4_minimax_child(root_state: Connect4State, depth: i32, action_path: array, action_count: u32) -> f32 {\n // Traverses down to the specified child node and runs minimax from there.\n\n var state: Connect4State = root_state;\n for (var i: u32 = 0u; i < action_count; i = i + 1u) {\n let action: u32 = action_path[i];\n if ((state.red_cols[action] | state.yellow_cols[action]) == 0x3Fu) {\n if (state.current_player == input_data.current_player) {\n return -1000.0;\n } else {\n return 1000.0;\n }\n }\n state = connect4_apply_action(state, state.current_player, action);\n if (state.in_progress == 0u) {\n if (state.winning_player == input_data.current_player) {\n return 1.0;\n } else if (state.winning_player != 0u) {\n return -1.0;\n } else {\n return 0.0;\n }\n }\n }\n return connect4_minimax(state, depth);\n}\n\n// Expand out to the parallelism we have and then do a dfs minimax from there.\n// There are 7 workgroups, each workgroup has 49 threads.\n// So each thread is scoring a node 3 layers down from the root.\n// Once all the threads are done, reduce the scores up those layers to the root and return them.\n\n// Each dfs eval checks 5 moves ahead so all together we're doing an 8 move search.\n\nvar workgroup_scores: array;\nvar thread_scores: array;\n\n@group(0) @binding(0) var input_data: Connect4State;\n@group(0) @binding(1) var output_data: array;\n\n@compute @workgroup_size(49)\nfn main(\n @builtin(workgroup_id) workgroup_v : vec3,\n @builtin(local_invocation_index) local_invocation_index: u32,\n) {\n let workgroup_i: u32 = workgroup_v.x;\n let thread_i: u32 = local_invocation_index;\n\n let workgroup_action: u32 = workgroup_i;\n let thread_first_action: u32 = thread_i / 7u;\n let thread_second_action: u32 = thread_i % 7u;\n\n var child_action_path: array;\n child_action_path[0] = workgroup_action;\n child_action_path[1] = thread_first_action;\n child_action_path[2] = thread_second_action;\n\n let thread_score: f32 = connect4_minimax_child(input_data, 5, child_action_path, 3u);\n thread_scores[thread_i] = thread_score;\n\n workgroupBarrier();\n\n if (thread_i % 7u == 0u) {\n var action_score: f32 = -1000.0;\n for (var i: u32 = 0u; i < 7u; i = i + 1u) {\n let score: f32 = thread_scores[thread_i + i];\n action_score = max(action_score, score);\n }\n workgroup_scores[thread_i / 7u] = action_score;\n }\n\n workgroupBarrier();\n\n if (thread_i == 0u) {\n var final_score: f32 = 1000.0;\n for (var i: u32 = 0u; i < 7u; i = i + 1u) {\n let score: f32 = workgroup_scores[i];\n final_score = min(final_score, score);\n }\n output_data[workgroup_i] = final_score;\n }\n}\n\n// getting a problem where it always gives up if it could lose if the player plays perfectly.\n// weighting scores by depth helps with that.",[],[201],{"_103":210,"_95":211,"_152":212,"_154":-5,"_155":138,"_156":213,"_158":159,"_105":214,"_100":32,"_161":162,"_163":215,"_165":22,"_166":-5,"_167":216,"_98":217},"b64e96e6-b5da-11f0-b83f-0224a6c84d84","deno.json","b64e97a4-b5da-11f0-b83f-0224a6c84d84",12,["D",1761861141411],"{\n \"$schema\": \"https://raw.githubusercontent.com/denoland/deno/98f62cee78e85bfc47c62ed703777c6bc8794f1c/cli/schemas/config-file.v1.json\",\n \"lock\": false,\n \"compilerOptions\": {\n \"noImplicitAny\": false,\n \"strict\": true,\n \"types\": [\"https://www.val.town/types/valtown.d.ts\"],\n \"lib\": [\n \"dom\",\n \"dom.iterable\",\n \"dom.asynciterable\",\n \"deno.ns\",\n \"deno.unstable\"\n ]\n },\n \"lint\": {\n \"include\": [\"deno:/https/esm.town/**/*\"],\n \"rules\": {\n \"exclude\": [\"no-explicit-any\"]\n }\n },\n \"node_modules_dir\": false,\n \"experimental\": {\n \"unstable-node-globals\": true,\n \"unstable-temporal\": true,\n \"unstable-worker-options\": true,\n \"unstable-sloppy-imports\": true\n }\n}",[],[211],{"_103":219,"_95":220,"_152":221,"_154":-5,"_155":138,"_156":222,"_158":159,"_105":223,"_100":224,"_161":162,"_163":225,"_165":22,"_166":-5,"_167":226,"_98":227},"d8cd87de-b8fc-11f0-aef3-0224a6c84d84","index.html","68e83e66-b5d5-11f0-8856-0224a6c84d84",1172,["D",1762205655685],38,"\n\n\n\n \n \n Connect 4\n \n\n\n\n

Player 1's Turn (Red)

\n\n

\n \n

\n\n

\n \n \n \n \n \n \n \n

\n\n

\n \n

\n\n \n\n\n",[],[220],{"_103":229,"_95":230,"_152":231,"_154":-5,"_155":138,"_156":232,"_158":159,"_105":233,"_100":234,"_161":235,"_163":236,"_165":22,"_166":237,"_167":238,"_98":239},"f6190472-b5db-11f0-9f9a-0224a6c84d84","server.ts","6cabdbd4-b5d5-11f0-a1d5-0224a6c84d84",20,["D",1761861677960],8,"http","import { staticHTTPServer } from \"https://esm.town/v/std/utils/index.ts\";\n\nexport default staticHTTPServer(import.meta.url);","connect4",[],[230],"files",[150,170,179,188,199,209,218,228],"counts",{"_244":32,"_245":246,"_247":32,"_248":249},"pulls","branches",1,"forks","envVars",{"_250":32,"_251":32},"count","emptyCount","contents",[],{"_103":151,"_95":99,"_152":153,"_154":-5,"_155":138,"_156":157,"_158":159,"_105":255,"_100":32,"_161":162,"_163":164,"_165":22,"_166":-5,"_98":256},["D",1761861141402],[99],"upstreamProject","upstreamBranch","emptyEnvVars","isNew","flags",[],"routes/_app.x.$handle.$name.code.$",{"_93":94,"_95":96,"_97":43,"_100":-7,"_98":99,"_101":265,"_148":270,"_240":295,"_162":296,"_252":298,"_299":-5,"_300":-5,"_301":-5,"_302":-5,"_303":304},{"_103":104,"_95":96,"_105":266,"_107":-5,"_108":22,"_109":110,"_111":112,"_113":-5,"_14":114,"_115":-5,"_116":22,"_117":-5,"_118":32,"_16":119,"_120":121,"_122":121,"_123":124,"_125":124,"_126":124,"_127":121,"_128":121,"_23":267,"_132":268,"_135":269,"_147":22},["D",1761858272949],{"_93":94,"_130":131},{"_93":94,"_134":131,"_14":114},{"_100":137,"_95":43,"_103":138,"_139":104,"_140":-5,"_141":-5,"_142":-5,"_143":-5,"_144":-5,"_145":96,"_146":94},[271,274,277,280,283,286,289,292],{"_103":151,"_95":99,"_152":153,"_154":-5,"_155":138,"_156":157,"_158":159,"_105":160,"_100":32,"_161":162,"_163":164,"_165":22,"_166":-5,"_167":272,"_98":273},[],[99],{"_103":171,"_95":172,"_152":173,"_154":-5,"_155":138,"_156":174,"_158":159,"_105":175,"_100":32,"_161":162,"_163":176,"_165":22,"_166":-5,"_167":275,"_98":276},[],[172],{"_103":180,"_95":181,"_152":182,"_154":-5,"_155":138,"_156":137,"_158":159,"_105":183,"_100":184,"_161":162,"_163":185,"_165":22,"_166":-5,"_167":278,"_98":279},[],[181],{"_103":189,"_95":190,"_152":191,"_154":-5,"_155":138,"_156":192,"_158":159,"_105":193,"_100":194,"_161":195,"_163":196,"_165":22,"_166":-5,"_167":281,"_98":282},[],[190],{"_103":200,"_95":201,"_152":202,"_154":-5,"_155":138,"_156":203,"_158":159,"_105":204,"_100":205,"_161":162,"_163":206,"_165":22,"_166":-5,"_167":284,"_98":285},[],[201],{"_103":210,"_95":211,"_152":212,"_154":-5,"_155":138,"_156":213,"_158":159,"_105":214,"_100":32,"_161":162,"_163":215,"_165":22,"_166":-5,"_167":287,"_98":288},[],[211],{"_103":219,"_95":220,"_152":221,"_154":-5,"_155":138,"_156":222,"_158":159,"_105":223,"_100":224,"_161":162,"_163":225,"_165":22,"_166":-5,"_167":290,"_98":291},[],[220],{"_103":229,"_95":230,"_152":231,"_154":-5,"_155":138,"_156":232,"_158":159,"_105":233,"_100":234,"_161":235,"_163":236,"_165":22,"_166":237,"_167":293,"_98":294},[],[230],[271,274,277,280,283,286,289,292],{"_103":151,"_95":99,"_152":153,"_154":-5,"_155":138,"_156":157,"_158":159,"_105":255,"_100":32,"_161":162,"_163":164,"_165":22,"_166":-5,"_98":297},[99],[],"upstream","pull","ahead","behind","templates",[],"actionData","errors"]

saolsen

connect4_ai