Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)

A Trappy Alpha-Beta Search Algorithm in Chinese Chess Computer Game

Authors
Jian Fang, Jian Chi, Hong-Yi Jian
Corresponding Author
Jian Fang
Available Online March 2013.
DOI
10.2991/iccsee.2013.67How to use a DOI?
Keywords
alpha-beta search, Chinese chess computer game, game-tree, iterative deepening, min-max search, trappy minimax
Abstract

In this paper, we propose an improved alpha-beta search algorithm, named trappy alpha-beta (simply TrapA B), for game-tree in order to identify and set the potential traps in the game playing. TrapA B can be regarded as an extension of the traditional alpha-beta search algorithm which ties to predict when the opponent might make a mistake and select such moves that can most likely lead the an opponent into the trap by comparing the various scores returned through iterative deepening technology. In TrapA B, we define two basic components: 1) defining a trap by considering the nature of alpha-beta search algorithm and referring the evaluation value returned by iterative deepening; and 2) evaluating a trap by calculating the probability that the opponent fall into the trap and the advantage followed when the opponent fall into it. In our experiment, we test the performance of TrapA B in comparison with three game-tree search algorithms, i.e., min-max, trappy minimax, and alpha-beta, by playing with four testing opponents (their depthes are 7, 8, 9, and 10 respectively), which are obtained form a typical Chinese chess computer game programme-Xqwizard (http://www.xqbase.com/). The comparative results show that our designed TrapA B can effectively find and set the traps in the playing with opponents.

Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
Series
Advances in Intelligent Systems Research
Publication Date
March 2013
ISBN
978-90-78677-61-1
ISSN
1951-6851
DOI
10.2991/iccsee.2013.67How to use a DOI?
Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Jian Fang
AU  - Jian Chi
AU  - Hong-Yi Jian
PY  - 2013/03
DA  - 2013/03
TI  - A Trappy Alpha-Beta Search Algorithm in Chinese Chess Computer Game
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 260
EP  - 263
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.67
DO  - 10.2991/iccsee.2013.67
ID  - Fang2013/03
ER  -