Aggregating consistent endgame knowledge in Chinese Chess

Chen, Bo-Nian; Liu, Pangfeng; Hsu, Shun-Chin; Hsu, Tsan-sheng

doi:10.1016/j.knosys.2011.11.020

Cited by 10 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [20], a domain-specific indexing function was proposed. Chinese Chess involves knowledgebased techniques for endgames and integrates the search engine with a conflict-free knowledge base of 123 985 material combinations [3]. In Connect6, a threat space search is implemented to determine whether a position will result in a win or a loss [18].…”

Section: B Endgame Databasesmentioning

confidence: 99%

“…11, and are labeled isomorphic in the permuted graph; hence, and are structural equivalent. 3 If there is more than one piece of the same kind, such as the two pawns in Example 6, the two pawns should be encoded as and when they are used in and because is a piece, not a kind of piece. However, the positions in a material combination implicitly indicate the encodings.…”

Section: Examplementioning

confidence: 99%

See 1 more Smart Citation

Equivalence Classes in Chinese Dark Chess Endgames

Chen

Lin

Chen

et al. 2015

IEEE Trans. Comput. Intell. AI Games

Self Cite

View full text Add to dashboard Cite

Chinese Dark Chess, a nondeterministic two-player game, has not been studied thoroughly. State-of-the-art programs focus on using search algorithms to explore the probability behavior of flipping unrevealed pieces in the opening and the midgame phases. There has been comparatively little research on opening books and endgame databases, especially endgames with nondeterministic flips. In this paper, we propose an equivalence relation that classifies the complex piece relations between the material combinations of each player, and derive a partition for all such material combinations. The technique can be applied to endgame database compression to reduce the number of endgames that need to be constructed. As a result, the computation time and the size of endgame databases can be reduced substantially. Furthermore, understanding the piece relations facilitates the development of a well-designed evaluation function and enhances the search efficiency. In Chinese Dark Chess, the number of nontrivial material combinations comprised of only revealed pieces is 8 497 176, and the number that contain at least one unrevealed piece is 239 980 775 397. Under the proposed method, the compression rates of the above material combinations reach 28.93% and 42.52%, respectively; if the method is applied to endgames comprised of three to eight pieces, the compression rates reach 5.82% and 5.98%, respectively.

show abstract

Section: B Endgame Databasesmentioning

confidence: 99%

Section: Examplementioning

confidence: 99%

Equivalence Classes in Chinese Dark Chess Endgames

Chen

Lin

Chen

et al. 2015

IEEE Trans. Comput. Intell. AI Games

Self Cite

View full text Add to dashboard Cite

show abstract

“…In CC, an external memory algorithm was presented in order to save the space used for a single endgame, just as KCP GGM M kggmm whose size is 8.2 GB [11]. Besides the above algorithm, there are knowledge-based techniques for CC endgames and CC integrates the search engine with the use of a knowledge base of 124,747 material combinations [12]. Furthermore, potential errors were corrected by the methods mentioned in [13] and [14].…”

mentioning

confidence: 99%

Compressing Chinese dark chess endgame databases

Chen

Fan

Tsai

et al. 2015

2015 IEEE Conference on Computational Intelligence and Games (CIG)

Self Cite

View full text Add to dashboard Cite

Building endgame databases is a common practice for boosting the performance of many computer game programs. After databases are constructed, we usually apply compression to save space. In order not to decrease the performance of accessing compressed files, we used block-based compression routines such as gzip. It is usually the case that bigger databases bring more gains. The sizes of the databases are fairly large even after using state-of-the-art compression programs. We discovered that the compression ratios vary a lot when different position indexing methods are used in a raw endgame file. The intuition is that when a continuous chunk of positions has more uniform values, gzip can better compress it than that of the case of having diversified values in this chunk. We report indexing methods that can upto 79.89% in compared to a naive indexing one when both are gziped. Our heuristics can be used on other chess-like endgames.

show abstract

A Combined Position Evaluation Function in Chinese Chess Computer Game

Wang

2013

Transactions on Computational Science XVII

View full text Add to dashboard Cite

Aggregating consistent endgame knowledge in Chinese Chess

Cited by 10 publications

References 14 publications

Equivalence Classes in Chinese Dark Chess Endgames

Equivalence Classes in Chinese Dark Chess Endgames

Compressing Chinese dark chess endgame databases

A Combined Position Evaluation Function in Chinese Chess Computer Game

Contact Info

Product

Resources

About