A game tree with distinct leaf values which is easy for the alpha-beta algorithm (Q1190799): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q201847 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Milan Mareš / rank | |||
Normal rank | |||
Revision as of 03:39, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A game tree with distinct leaf values which is easy for the alpha-beta algorithm |
scientific article |
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
