The user wants a single-page web app that:
1. Generates a random maze using recursive-backtracker algorithm on a canvas
2. Animates an A-star or BFS solver finding the path from start to finish

Everything in one self-contained index.html file with CSS in a <style> tag and JS in a <script> tag, no external resources.

Let me design this carefully.

I'll write:
- Grid-based maze (2D array of cells, each with walls)
- Recursive backtracker maze generation (with animation or at least visually)
- BFS or A* pathfinding with animation from start (top-left) to finish (bottom-right)
- Canvas rendering

Let me write the full HTML file. I'll include:
- A canvas
- Controls (generate button, solve button, maybe algorithm select)
- Stats display

Let me make the maze generation animated too, which is nice visually. I'll make the cell size reasonable, like 20x20 pixels per cell. Let me pick cols/rows based on canvas size.

Let me write this thoughtfully. I'll use a configurable grid. Let me use 30x30 cells or so for a decent display.

I'll implement:
- Cell walls: each cell has 4 walls (N, E, S, W)
- Recursive backtracker: stack-based, randomly visit neighbors
- A* with Manhattan distance heuristic

Let me make both animations smooth using requestAnimationFrame with a delay between steps, or setTimeout.

Let me write the code.

For animation, I'll use async functions with a sleep helper that waits via setTimeout, but I want it to still render. Actually for generation animation, I'll do steps and repaint.

Let me structure:
- Maze class managing grid
- generateMaze() async generator
- aStar() async

Let me write it all.

I'll make the canvas responsive. Let me compute.

Let me write the complete file.

For rendering, I'll draw walls as lines.

Let me code A* with open set, using a simple array or priority queue. I'll implement a binary heap for efficiency, but for simplicity with 30x30 that's fine with arrays. Let me use a binary heap for cleanliness.

Actually, to keep it simpler and robust, I'll use a sorted array approach or just a heap. Let me write a small binary heap.

Let me write the full thing now.

I'll make the maze generation also animated with backtracking shown. Let me add colors: current cell highlighted, visited cells.

Let me write the code carefully.

Let me begin.