TY - GEN
T1 - Game tree search with adaptive resolution
AU - Chang, Hung Jui
AU - Tsai, Meng-Tsung
AU - Hsu, Tsan Sheng
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84864964425&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-31866-5_26
DO - 10.1007/978-3-642-31866-5_26
M3 - Conference contribution
AN - SCOPUS:84864964425
SN - 9783642318658
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 306
EP - 319
BT - Advances in Computer Games - 13th International Conference, ACG 2011, Revised Selected Papers
T2 - 13th International Conference on Advances in Computer Games, ACG 2011
Y2 - 20 November 2011 through 22 November 2011
ER -