Affiliation:
1. Hebei Normal University for Nationalities
Abstract
In this paper, an improved trappy alpha-beta (simply) algorithm, namedis proposed.is an extended version ofby introducing the two-ply iterative deepening (TPID). By applying TPID, can search more deeply and therefore find the traps hidden more deep plies in game-tree. The experimental results reflect thatindeed obtains the better chess playing performance than.
Publisher
Trans Tech Publications, Ltd.
Reference9 articles.
1. J. Fang, J. Chi, H. Y. Jian, : a new position search algorithm in Chinese chess computer game, Applied Mechanics and Materials, vol. 380-384, pp.1621-1624, (2013).
2. C. E. Shannon, Programming a computer for playing chess, Philosophical Magazine, vol. 41, no. 314, pp.256-275, (1950).
3. J. Schaeffer, The history heuristic and alpha-beta search enhancements in practice, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp.1203-1212, (1989).
4. J. J. Gillogly, The technology chess program, Artificial Intelligence, vol. 3, pp.145-163, (1972).
5. J. Clune, Heuristic evaluation functions for general game playing, In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, pp.1134-1139, (2007).