Trappy Alpha-Beta with Two-Ply Iterative Deepening

Jian Fang; Yan Ming Zhao; Wen Xiao Zhang

doi:10.4028/www.scientific.net/AMM.713-715.2008

Paper Titles

The Study on Fire Evolution Characteristics in Multi-Room Environment
p.1992

The Traffic Accident Scene Drawing System Based on Image Trapezoid Distortion Correction
p.1996

The Traffic Flow Model of Intelligent Transportation System
p.2000

Theory and Algorithms Research on New Concept Lattice Generated Based on Detrimental of Old Concept Lattice
p.2004

Trappy Alpha-Beta with Two-Ply Iterative Deepening
p.2008

Two Conversion Formulas of Known Optimal Sequences
p.2012

Two Methods for the Expectation in Envelopes Pairing Problem
p.2016

Two-Tuple Linguistic Information in Group Decision-Making Problem
p.2020

Uncertain Internet Public Opinion Emergency Decision-Making Method under Interval-Valued Fuzzy Environment
p.2024

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 713-715Trappy Alpha-Beta with Two-Ply Iterative Deepening

Trappy Alpha-Beta with Two-Ply Iterative Deepening

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 713-715)

Pages:

2008-2011

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.713-715.2008

Citation:

Cite this paper

Online since:

January 2015

Authors:

Jian Fang*, Yan Ming Zhao, Wen Xiao Zhang

Keywords:

Game-Tree, Iterative Deepening, Trappy Alpha-Beta

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[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).

DOI: 10.4028/www.scientific.net/amm.380-384.1621

Google Scholar

[2] C. E. Shannon, Programming a computer for playing chess, Philosophical Magazine, vol. 41, no. 314, pp.256-275, (1950).

DOI: 10.1080/14786445008521796

Google Scholar

[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).

DOI: 10.1109/34.42858

Google Scholar

[4] J. J. Gillogly, The technology chess program, Artificial Intelligence, vol. 3, pp.145-163, (1972).

DOI: 10.1016/0004-3702(72)90045-8

Google Scholar

[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).

Google Scholar

[6] Michael Tarsi, Optimal search on some game trees, Journal of the ACM, vol. 30, no. 3, pp.389-396, (1983).

DOI: 10.1145/2402.322383

Google Scholar

[7] M. S. Campbell, T. A. Marsland, A comparison of minimax tree search algorithms, Artificial Intelligence, vol. 20, no. 4, pp.347-367, (1983).

DOI: 10.1016/0004-3702(83)90001-2

Google Scholar

[8] V. S. Gordon, Ahmed Reda, Trappy minimax-using iterative deepening to identify and set traps in two-player games, In Proceedings of 2006 IEEE Symposium on Computational Intelligence and Games, pp.205-210, (2006).

DOI: 10.1109/cig.2006.311702

Google Scholar

[9] X. Z. Wang, Y. L. He, P. Su, W. L. Li, Two-ply iterative deepening in Chinese-chess computer game, In Proceedings of the Eighth International Conference on Machine Learning and Cybernetics, pp.2020-2026, (2009).

DOI: 10.1109/icmlc.2009.5212141

Google Scholar