A game tree with distinct leaf values which is easy for the alpha-beta algorithm (Q1190799): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of searching game trees and other recursion trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4855552 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of alpha-beta pruning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993187 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A minimax algorithm better than alpha-beta? Yes and no / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A minimax algorithm better than alpha-beta? / rank | |||
Normal rank | |||
Latest revision as of 11:50, 16 May 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
