Maze generator & solver · qwen3-next-80b-a3b-instruct
Output generated Cost / run $0.0046 Runtime 10.0s
Prompt for this run
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.
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
METRICS
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 an A* solver finding the path from start to finish. Let me build this as a self-contained HTML file with CSS and JavaScript inline
index.html (14123 bytes)Successfully wrote 14123 bytes to index.html
I've created a complete single-page web app that generates a random maze using the recursive backtracker algorithm and animates an A* solver finding the path from start to finish. The app is contained in a single self-contained `index.html` file with all CSS and JavaScript inline, and no external resources are used. The app features: - A maze generator using the recursive backtracker algorithm - An A* pathfinding solver with animation - Controls to generate new mazes, solve mazes, and reset - Visual feedback showing visited cells (light blue) and the solution path (green) - Start (green) and end (red) points clearly marked The maze is rendered on a canvas with a grid of 20x20 pixel cells, creating a 25x25 cell maze (500x500 pixels total). All code runs completely sandboxed with no network requests.