Algorithm
Visualization

Interactive visualizations of classical algorithms.
Click the maze to set start & end. Play against a minimax AI.

Dijkstra's shortest path Minimax + alpha-beta
01

Dijkstra's Shortest Path

Click to place start (green) → end (red) → walls. Then run. The algorithm explores weighted cells and finds the optimal route.

Ready — click to place start/end
Start
End
Wall
Explored
Path
02

Connect Four — Minimax

Classic 4 Gewinnt. You play against an AI using minimax search with alpha-beta pruning. Adjust difficulty below.

Your turn — click a column

Turn

You are ■ Orange

AI is ■ Yellow

Algorithm

Minimax with alpha-beta pruning

Nodes: 0
Pruned: 0

Score

You: 0  |  AI: 0  |  Draws: 0

How it works

Alpha-beta pruning skips branches that can't improve the best known move. At depth 7, it evaluates millions of positions per move while pruning 60-90% of the tree.