Maze generator & solver · qwen3-vl-30b-a3b-instruct
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.
I'll create a single-page web app that generates a random maze using the recursive backtracker algorithm and animates a pathfinding solution (BFS) from start to finish.
index.html (9066 bytes)Successfully wrote 9066 bytes to index.html
I've created a complete single-page web application that: 1. Generates a random maze using the recursive backtracker algorithm 2. Animates a BFS pathfinding solution from start (top-left) to finish (bottom-right) 3. Includes a button to generate new mazes The implementation includes: - A canvas for rendering the maze and path - Cell-based maze representation with wall management - Recursive backtracker algorithm for maze generation - BFS algorithm for finding the shortest path - Animation of the pathfinding process - Start and end point markers (green and red) The maze is generated with walls between cells, and the solver navigates through open paths by checking if walls exist between adjacent cells. The path is animated step-by-step with a 50ms delay between each step. You can run this HTML file in any modern browser to see the maze generation and pathfinding animation.
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 generates and solver animates exploring paths with yellow dots from start to finish, continuing regardless of input.
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.