Chapters
Table of Contents
On this page
Intro to Search
Search Basics
Breadth First Search (BFS)
Depth First Search (DFS)
Uniform Cost Search (UCS)
Heuristic Search
Greedy Best-First Search (GBFS)
The A* Algorithm
Weighted A* (WA*)
Heuristics
Differential Heuristic (DH)
Compressed Path Database (CPD)
Fast Map Heuristic (FM)
Playground
Playgroundcurrent
Playground
Algorithm Playground
Draw complex maps on a full-width canvas, then compare algorithms side by side with perfectly mirrored grids.
Free Play
Full-width canvas — draw your map and run any algorithm. Grids saved here are stored separately from other pages.
Tool:
Algorithm:Heuristic:
Statistics
Nodes Expanded—
Nodes Generated—
Open Set Size—
Path Length—
Draw your map above, then click Run A* to generate the step trace.
Side-by-Side Comparison
All grids mirror each other — draw on any one. Select an algorithm per panel, then run them all simultaneously.
Tool:
Expanded
—
Open
—
Path
—
Expanded
—
Open
—
Path
—
Draw your map above, then click Run All to run every selected algorithm simultaneously.
Found this helpful?
These resources are free — if they saved you time, a coffee keeps them going.