HW1 — AI Search Lab
8-Puzzle Solver & Tic-Tac-Toe AI
Five search algorithms on the 8-puzzle. Minimax and Alpha-Beta on Tic-Tac-Toe. Every decision measured live — nodes explored, decision time, and pruning.
Modules
01
Single-agent search
8-Puzzle Solver
Plan a path of slides to the goal, and compare five strategies on one board.
- BFS · Dijkstra · A* · Greedy · IDA*
- Upload an image or use numbered tiles
- Shuffle · manual play · step-by-step solve
02
Adversarial search
Tic-Tac-Toe AI
Face a flawless opponent or watch two AIs play, with live pruning statistics.
- Human vs AI · AI vs AI · Human vs Human
- Minimax & Alpha-Beta pruning
- 3×3 perfect play · 4×4 k-in-a-row
DashboardDecision time, nodes, solution length & pruning — one shared panel.
No setupPure HTML/CSS/JS. Open the file; works offline, any OS.
AdmissibleManhattan & misplaced-tile heuristics never overestimate.
Built inDark/light, sound, undo, replay, save & load.
01 · Single-agent search
8-Puzzle Solver
A single-agent search problem: plan a sequence of slides toward the goal.
Setup
Solve
02 · Adversarial search
Tic-Tac-Toe with AI
An adversarial search problem: plan against an opponent who plays to win.