Alpha-Beta Pruning

Minmax with Alpha Beta Pruning Game Tree Search The Goal of a Chess Engine A chess engine is solving: “Given a position, what move leads to the best possible future?” But the engine cannot know the future, so it simulates it. This simulation is called search. The Game Tree Every legal move creates a new position. From that position, the opponent also has moves. This forms a tree: Position ├── Move A │ ├── Opp Move A1 │ │ ├── Move A1a │ │ └── Move A1b │ └── Opp Move A2 │ └── ... └── Move B └── ... This is called the game tree. ...