A game tree with distinct leaf values which is easy for the alpha-beta algorithm (Q1190799)
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: A game tree with distinct leaf values which is easy for the alpha-beta algorithm |
scientific article; zbMATH DE number 56247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A game tree with distinct leaf values which is easy for the alpha-beta algorithm |
scientific article; zbMATH DE number 56247 |
Statements
A game tree with distinct leaf values which is easy for the alpha-beta algorithm (English)
0 references
26 September 1992
0 references
The authors discuss the problem of efficient parallel searching in a game tree. They present a specific group of game trees with distinct leaf values in which an easy alpha-beta sequential algorithm exists and is independent of the move ordering.
0 references
efficient parallel searching in a game tree
0 references
alpha-beta sequential algorithm
0 references
0.8241650462150574
0 references
0.8195057511329651
0 references
0.7978388071060181
0 references
0.7878573536872864
0 references
