Algorithm Explorer
Search and filter artificial intelligence algorithms. Select any algorithm to open its interactive step-by-step visualization page.
Category:
Difficulty:
Uninformed SearchBeginner
Breadth-First Search (BFS)
Explores nodes level-by-level using a FIFO queue. Guarantees shortest path on unweighted graphs.
TIMEO(V + E)
SPACEO(V)
Uninformed SearchBeginner
Depth-First Search (DFS)
Traverses graph branches as deep as possible before backtracking using a LIFO stack.
TIMEO(V + E)
SPACEO(V)
Uninformed SearchIntermediate
Uniform Cost Search (UCS)
Expands nodes with the lowest path cost g(n) using a priority queue (Dijkstra's equivalent).
TIMEO(E + V log V)
SPACEO(V)
Informed SearchIntermediate
Greedy Best-First Search (Greedy BFS)
Expands nodes closest to the goal according to a heuristic function h(n).
TIMEO(b^m)
SPACEO(b^m)
Informed SearchIntermediate
A* Search Algorithm (A*)
Combines path cost g(n) and heuristic h(n) to guarantee optimal search efficiency.
TIMEO(E log V)
SPACEO(V)
Local SearchBeginner
Hill Climbing (Hill Climbing)
Continually moves in the direction of increasing value/fitness to find local optima.
TIMEO(∞) / State-dependent
SPACEO(1)
Local SearchAdvanced
Genetic Algorithm (Genetic Algo)
Simulates biological evolution through selection, crossover, and mutation to solve complex search spaces.
TIMEO(g * p * f)
SPACEO(p)