The solution for the branching factor of the alpha-beta pruning algorithm and its optimality (Q3947131)
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: The solution for the branching factor of the alpha-beta pruning algorithm and its optimality |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The solution for the branching factor of the alpha-beta pruning algorithm and its optimality |
scientific article |
Statements
The solution for the branching factor of the alpha-beta pruning algorithm and its optimality (English)
0 references
1982
0 references
average number of terminal nodes
0 references
uniform game tree
0 references
search depth
0 references
search time
0 references
lower bound for the average complexity
0 references
game searching algorithms
0 references
minimax algorithms
0 references
branch and bound search
0 references
average case analysis
0 references
