Abstract
Game playing is one of the classic problems of artificial intelligence. The Siguo game is an emerging field of research in the area of game-playing programs. It provides a new test bed for artificial intelligence with imperfect information. To improve search efficiency for Siguo with more branches and the uncertain payoff in the game tree, this paper presents a modified Alpha-Beta Aspiration Search algorithm, which is called Alpha-Beta Aspiration with Timer Algorithm (AWT). The AWT can quickly find a suboptimal payoff (acceptable value) from the game tree by adjusting a window with a timer. The timer is controlled by two parameters (M, N) that vary with the chess-board status of Siguo. Experiments show that AWT achieves the goals of the improvability of time efficiency, although it costs a little more memory and does not lead to the best payoff, but to an acceptable payoff.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bud, A., Albrecht, D., Nicholson, A., Zukerman, I.: Information-Theoretic Advisors in Invisible Chess. In: AI and Statistics 2001, Eighth International Workshop on Artificial Intelligence and Statistics (2001)
Campbell, M.S., Marsland, T.A.: A comparison of minimax tree search algorithms. Artificial Intelligence 20(4), 347–367 (1983)
Ginsberg, M.L.: GIB: Imperfect information in a computationally challenging game. Journal of Artificial Intelligence Research 14, 303–358 (2001)
Kaindl, H., Shams, R., Horacek, H.: Minimax Search Algorithms with and without Aspiration Windows. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(12), 1225–1235 (1991)
Knuth, D.E., Moore, R.W.: An analysis of Alpha-Beta Pruning. Artificial Intelligence 6(4), 293–326 (1975)
Marsland, T.A.: Relative Efficiency of Alpha-Beta Implementations. In: Proceedings of the 8th International Joint Conference on Artificial Intelligence (IJCAI1983), pp. 763–766 (1983)
Plaat, A.: Research Re: search and Re-search. PhD thesis, Tinbergen Institute and Department of Computer Science, Erasmus University Rotterdam, The Netherlands (1996)
Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-First Fixed-Depth Game-Tree Search in Practice. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 273–281 (1995)
Stockman, G.C.: A minimax algorithm better than Alpha-Beta? Artificial Intelligence 12(2), 179–196 (1975)
Xia, Z., Zhu, Y., Lu, H.: Using the Loopy Belief Propagation in Siguo. ICGA Journal 30(4), 209–220 (2007)
Xia, Z., Hu, Y., Wang, J., Jiang, Y.C., Qin, X.L.: Analyze and Guess Type of Piece in the Computer Game Intelligent System. In: Wang, L., Jin, Y. (eds.) FSKD 2005. LNCS (LNAI), vol. 3614, pp. 1174–1183. Springer, Heidelberg (2005)
Xia, Z., Zhu, Y., Lu, H.: Evaluation Function for Siguo Game Based on Two Attitudes. In: The Third International Conference on Fuzzy Systems and Knowledge Discovery, pp. 1322–1331 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, H., Xia, Z. (2008). AWT: Aspiration with Timer Search Algorithm in Siguo. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds) Computers and Games. CG 2008. Lecture Notes in Computer Science, vol 5131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87608-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-87608-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87607-6
Online ISBN: 978-3-540-87608-3
eBook Packages: Computer ScienceComputer Science (R0)