Game Tree Search with Adaptive Resolution

  • Hung-Jui Chang
  • Meng-Tsung Tsai
  • Tsan-sheng Hsu
Conference paper

DOI: 10.1007/978-3-642-31866-5_26

Volume 7168 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chang HJ., Tsai MT., Hsu T. (2012) Game Tree Search with Adaptive Resolution. In: van den Herik H.J., Plaat A. (eds) Advances in Computer Games. ACG 2011. Lecture Notes in Computer Science, vol 7168. Springer, Berlin, Heidelberg

Abstract

In this paper, we use an adaptive resolution R to enhance the min-max search with alpha-beta pruning technique, and show that the value returned by the modified algorithm, called Negascout-with-resolution, differs from that of the original version by at most R. Guidelines are given to explain how the resolution should be chosen to obtain the best possible outcome. Our experimental results demonstrate that Negascout-with-resolution yields a significant performance improvement over the original algorithm on the domains of random trees and real game trees in Chinese chess.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Hung-Jui Chang
    • 1
  • Meng-Tsung Tsai
    • 1
  • Tsan-sheng Hsu
    • 1
  1. 1.Institute of Information ScienceAcademia SinicaTaipeiTaiwan