Chapter

Advances in Computer Games

Volume 7168 of the series Lecture Notes in Computer Science pp 306-319

Game Tree Search with Adaptive Resolution

  • Hung-Jui ChangAffiliated withInstitute of Information Science, Academia Sinica
  • , Meng-Tsung TsaiAffiliated withInstitute of Information Science, Academia Sinica
  • , Tsan-sheng HsuAffiliated withInstitute of Information Science, Academia Sinica

* Final gross prices may vary according to local VAT.

Get Access

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.