Experimenting with Revisits in Game Tree Search

Bhattacharya, Subir

Experimenting with Revisits in Game Tree Search

Download BibTeX Cite

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 243-250.

Abstract

The oldest known game tree search algorithm Alpha-Beta is still the most popular one. All other algorithms in this area fall short of Alpha-Beta in one or more of the following three desired characteristics - high pruning power, low storage requirement and low execution time. This paper discusses bow revisit of nodes can be used effectively in game tree search. A few strategies of introducing revisits in game tree search are presented. It is demonstrated that for any shape and ordering of the game tree to be searched, there always exists one strategy that, on an average, consistently evaluates less number of terminals than Alpha-Beta in comparable memory and time.

Subir Bhattacharya. 1995. Experimenting with Revisits in Game Tree Search. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95. IJCAI, 243–250. https://ijcai.org/proceedings/1995/32

@inproceedings{ijcai1995p32,
  title     = {Experimenting with Revisits in Game Tree Search},
  author    = {Bhattacharya, Subir},
  booktitle = {Proceedings of the Fourteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-95}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Chris S. Mellish},
  pages     = {243--250},
  year      = {1995},
  note      = {Automated Reasoning},
  url       = {https://ijcai.org/proceedings/1995/32},
}

TY  - CPAPER
TI  - Experimenting with Revisits in Game Tree Search
AU  - Bhattacharya, Subir
T2  - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1995
SP  - 243
EP  - 250
UR  - https://ijcai.org/proceedings/1995/32
ER  -