A Quantitative Study of $$2 \times 4$$ 2 × 4 Chinese Dark Chess-Reference-Cited by-同舟云学术

A Quantitative Study of $$2 \times 4$$ 2 × 4 Chinese Dark Chess

Published:2014 Issue: Volume: Page:151-162
ISSN:0302-9743
Container-title:Computers and Games
language:
Short-container-title:

Author:

Chang Hung-Jui,Hsu Tsan-sheng

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-09165-5_13

Reference10 articles.

1. Chen, B.-N., Shen, B.-J., Hsu, T.-S.: Chinese dark chess. ICGA J. 33(2), 93–106 (2010)

2. Chen, J.-C., Lin, T.-Y., Hsu, S.-C., Hsu, T.-s.: Design and implementation of computer chinese dark chess endgame database. In: Proceedings of TCGA Workshop, pp. 5–9 (2012)

3. Chen, J.-C., Lin, T.-Y., Hsu, T.-s.: Equivalence partition of dark chess endgames (submitted) (2013)

4. Knuth, D.E.: The art of computer programming. In: Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions, vol. 4, 1st edn. Addison-Wesley Professional, New York (2008)

5. Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97–109 (1985)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An investigation of strength analysis metrics for game-playing programs: A case study in Chinese dark chess;ICGA Journal;2019-02-07

2. Compressing Chinese Dark Chess Endgame Databases by Deep Learning;IEEE Transactions on Games;2018-12

3. AlphaZero for a Non-Deterministic Game;2018 Conference on Technologies and Applications of Artificial Intelligence (TAAI);2018-11

4. An analysis for strength improvement of an MCTS-based program playing Chinese dark chess;Theoretical Computer Science;2016-09

5. Monte-Carlo Tree Reductions for Stochastic Games;Technologies and Applications of Artificial Intelligence;2014