Game tree search with adaptive resolution

Hung Jui Chang, Meng-Tsung Tsai, Tsan Sheng Hsu*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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.

Original languageEnglish
Title of host publicationAdvances in Computer Games - 13th International Conference, ACG 2011, Revised Selected Papers
Number of pages14
StatePublished - 20 Aug 2012
Event13th International Conference on Advances in Computer Games, ACG 2011 - Tilburg, Netherlands
Duration: 20 Nov 201122 Nov 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7168 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Conference on Advances in Computer Games, ACG 2011

Fingerprint Dive into the research topics of 'Game tree search with adaptive resolution'. Together they form a unique fingerprint.

Cite this