Alpha-Beta Pruning (Q7361333)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Alpha_Beta_Pruning
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alpha-Beta Pruning |
AFP entry Alpha_Beta_Pruning |
Statements
13 June 2024
0 references
Tobias Nipkow
0 references
Alpha-Beta Pruning (English)
0 references
Alpha-beta pruning is an efficient search strategy for two-player game trees. It was invented in the late 1950s and is at the heart of most implementations of combinatorial game playing programs. These theories formalize and verify a number of variations of alpha-beta pruning, in particular fail-hard and fail-soft, and valuations into linear orders, distributive lattices and domains with negative values. A detailed presentation of these theories can be found in the chapter Alpha-Beta Pruning in the (forthcoming) book Functional Data Structures and Algorithms --- A Proof Assistant Approach .
0 references
