A new representation of Chinese chess board

Computer-games research has opened a door to a multi-discipline domain across artificial intelligence, computer-aided design and computer graphics. Chinese chess is one of the most popular board games worldwide and many researches on move generation, position evaluation, searching, opening and endgame play, have been developed. However, few work has been done in the basic representation of Chinese chess board. Currently the representation of 10×9 integer array is widely used in Chinese chess programming. In this paper, based on concrete theoretical analysis, a new presentation of Chinese chess board with 6 long integers is proposed. Compared to the traditional 10 × 9 int-array representation that is often redundant in endgames, the cost of storage with the new representation is greatly reduced by an order of magnitude.

[1]  Monty Newborn.  Deep Blue's contribution to AI , 2004, Annals of Mathematics and Artificial Intelligence.

[2]  Claude E. Shannon,et al.  Programming a computer for playing chess , 1950 .

[3]  L. V. Allis,et al.  Searching for solutions in games and artificial intelligence , 1994 .

[4]  Tsan-sheng Hsu,et al.  Indefinite Sequence of Moves in Chinese Chess Endgames , 2002, Computers and Games.

[5]  Tsan-sheng Hsu,et al.  Construction of Chinese Chess Endgame Databases by Retrograde Analysis , 2000, Computers and Games.

[6]  Siang Yew Chong,et al.  Observing the evolution of neural networks learning to play the game of Othello , 2005, IEEE Transactions on Evolutionary Computation.

[7]  Tsan-sheng Hsu,et al.  Knowledge Inferencing on Chinese Chess Endgames , 2008, Computers and Games.

[8]  Jonathan Schaeffer,et al.  Checkers Is Solved , 2007, Science.

[9]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[10]  Jonathan Schaeffer,et al.  Games, computers, and artificial intelligence , 2002, Artif. Intell..

[11]  Hermann Kaindl,et al.  Minimax Search Algorithms With and Without Aspiration Windows , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Claude E. Shannon,et al.  XXII. Programming a Computer for Playing Chess 1 , 1950 .

[13]  Tsan-sheng Hsu,et al.  Verification of Endgame Databases , 2002, J. Int. Comput. Games Assoc..

[14]  H. Jaap van den Herik,et al.  Games solved: Now and in the future , 2002, Artif. Intell..