Minimax & Alpha-Beta Pruning
Visualize how AI makes decisions in games by searching the decision tree and pruning irrelevant branches.
Unvisited
Current
Pruned
📊 Performance Comparison
Minimax Visited Nodes:
0
Alpha-Beta Visited:
0
Pruning Savings:
0%
📜 Execution Log
Ready. Choose an algorithm to start.
💡 Concept
Minimax: Tries to maximize its own score while assuming the opponent will minimize it.
Alpha-Beta: An optimization that stops evaluating a branch once it proves to be worse than a previously seen branch.