Maze generator & solver · ministral-8b-2512
Generate a random maze with the recursive-backtracker algorithm on a canvas, then animate an A-star or BFS solver finding the path from start to finish.
transcript · 4 messages
Generate a random maze with the recursive-backtracker algorithm on a canvas, then animate an A-star or BFS solver finding the path from start to finish.
index.html (13086 bytes)Successfully wrote 13086 bytes to index.html
The self-contained `index.html` file has been created successfully in the current directory (`/tmp/ws`). This file includes: 1. **HTML Structure**: A canvas for rendering the maze and controls for generating the maze and running BFS/A* pathfinding. 2. **CSS**: Basic styling for the canvas and controls. 3. **JavaScript**: - **Maze Generation**: Uses the recursive backtracker algorithm to create a maze. - **Pathfinding Algorithms**: - **BFS (Breadth-First Search)**: Finds the shortest path from start to end. - **A\*** (A-Star): Uses heuristic to efficiently find the shortest path. - **Animation**: Visualizes the pathfinding process step-by-step. ### How to Use: 1. Open `index.html` in a web browser. 2. Click **"Generate Maze"** to create a new maze. 3. Click **"BFS Pathfinding"** or **"A* Pathfinding"** to animate the solver finding the path from start (green) to end (red). The entire app is self-contained—no external dependencies or network requests are required.
TAKE IT TO CODE
A single self-contained HTML file — copy it and open in any browser, or reuse the prompt with your own pi-agent run.
RUN
EVALUATION
Maze grid generated but pathfinding never triggered by any input; solver animation never shown.
Vision grade · anthropic/claude-sonnet-5
MEASUREMENTS
Raw readings from the capture, not a verdict — the grade above is the only judgement. Percentages are how much of the screen changed; the measure under-reports sparse motion on a dark background.