Minimax with
Alpha
-
Beta
Pruning
Discover how a game AI chooses its moves by following the Minimax algorithm step by step.
1
Follow the algorithm's search.
See how it moves through the game tree, node by node.
2
See how MAX and MIN think.
One wants to maximize the value, the other to minimize it.
3
Discover alpha-beta pruning.
The algorithm skips branches it doesn't need to examine.
4
Build your own game trees.
Change values and structure and try out your own ideas.
Get started
← AI-aktiviteter
Svenska
Minimax with
Alpha
-
Beta
Pruning
Discover how a game AI chooses its moves by following the Minimax algorithm step by step.
Example tree 1
Example tree 2
Example tree 3
Example tree 4
▶ Run
✎ Build
α-β
Build mode:
Click a node
to add children or change its value. Click
Run
when you're done.
MAX
MIN
Leaf node
✕
Pruned
Chosen path
Controls
◀
▶ Next step
Tip:
step through
to follow the algorithm's thinking.
⏵ Play automatically
↺ Reset
Playback speed
1×
What the algorithm is doing now
Press
▶ Next step
to follow the algorithm one step at a time.
Status
Step
0 / –
Visited nodes
0
Pruned nodes
0
The root node's final value
–
Step-by-step log
Press
Next step
to begin.
Minimax
MAX
MIN
Alpha (α)
Beta (β)
Pruning
✕