Multi-cut \(\alpha \beta\)-pruning in game-tree search (Q1589514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multi-cut \(\alpha \beta\)-pruning in game-tree search |
scientific article; zbMATH DE number 1542314
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-cut \(\alpha \beta\)-pruning in game-tree search |
scientific article; zbMATH DE number 1542314 |
Statements
Multi-cut \(\alpha \beta\)-pruning in game-tree search (English)
0 references
12 December 2000
0 references
minimax search procedure
0 references
forward-pruning method
0 references
0 references
0 references
0.8570125
0 references
0.84415704
0 references
0.83771014
0 references
0.8288411
0 references
0.8264089
0 references
