Greedy Best-First Search

Greedy Best-First Search prioritizes nodes estimated to be closest to the goal according to a heuristic function h(n). It is fast but not guaranteed to find the optimal path.

Category:Informed Search

•

Difficulty:Intermediate

•

Time complexity:O(b^m)

•

Space complexity:O(b^m)

Interactive visualizationGreedy BFS Visualizer

Edit mode: Click/drag to draw walls, drag Start (S) or Goal (G)

Start / Goal Wall Visited Frontier Path

0 / 0

Speed:

Nodes Explored0

Frontier Size0

Path Cost g(n)—

Total Steps0

No step trace active. Click "Visualize A*" to begin algorithm execution.