Search Algorithms

Visualize how different algorithms explore the state space.

Algorithm

Terrain Type (Click to Paint)

Nodes Visited: 0

Path Cost: 0

BFS: Explores all neighbors at depth d before d+1. Optimal for unweighted graphs.
DFS: Explores as far as possible along each branch before backtracking. Not optimal.
UCS: Expands the least cost node. Optimal for weighted graphs.
A*: Uses heuristic (Manhattan distance) to guide search. Optimal and efficient.