ConceptAI & ML
Alpha-beta pruning
An optimized search algorithm for minimax that eliminates branches in the search tree that do not need to be evaluated.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Minimax algorithm5Game trees4Minimax2Branch and bound1Exhaustive search1Game tree pruning1Game tree search1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
5Each in their own terms, from the easiest level.
Mark Seifter
A deterministic search algorithm for game trees that converges with certain tree-based methods over time.Patrick Winston
An algorithm that adds alpha and beta parameters to minimax to prune large sections of the search tree without affecting the final decision.Brian Yu
An optimization technique for minimax that allows us to eliminate searching through certain branches of the game tree by keeping track of the best and worst scores seen so far.Pieter Abbeel
An optimization technique for the minimax algorithm that eliminates branches that cannot possibly influence the final decision.Pieter Abbeel & Daniel Klein
An algorithm that reduces the size of the game tree search space, theoretically square rooting it.
Lectures that assume it
3Connections
18The lectures that define it or assume it, and the concepts next to it.
Concepts9
- Minimax algorithm
- Minimax
- Branch and bound
- Exhaustive search
- Depth-limited search
- Evaluation function bounds for pruning