Result: A game tree with distinct leaf values which is easy for the alpha-beta algorithm
Title:
A game tree with distinct leaf values which is easy for the alpha-beta algorithm
Authors:
Source:
Artificial Intelligence. 52:183-190
Publisher Information:
Elsevier BV, 1991.
Publication Year:
1991
Subject Terms:
alpha-beta sequential algorithm, efficient parallel searching in a game tree, Graph theory (including graph drawing) in computer science, Computational methods for problems pertaining to operations research and mathematical programming, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Games involving graphs, 01 natural sciences
Document Type:
Academic journal
Article
File Description:
application/xml
Language:
English
ISSN:
0004-3702
DOI:
10.1016/0004-3702(91)90042-i
Access URL:
Rights:
Elsevier TDM
Accession Number:
edsair.doi.dedup.....3a79470eba3c2d9ba4cc4ec16de7aa4c
Database:
OpenAIRE
Further Information
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.