Skip to main content
SpringerLink
Log in

A Quantitative Study of \(2 \times 4\) Chinese Dark Chess

  • Conference paper
  • First Online:
Book cover Computers and Games (CG 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8427))

Included in the following conference series:

Abstract

In this paper, we study Chinese dark chess (CDC), a popular 2-player imperfect information game that is a variation of Chinese chess played on a \(2\times 4\) game board. The \(2\times 4\) version is solved by computing the exact value of each board position for all possible fair piece combinations. The results of the experiments demonstrate that the initial arrangement of the pieces and the place to reveal the first piece are the most important factors to affect the outcome of a game.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For brevity, we use ‘he’ and ‘his’ whenever ‘he or she’ and ‘his or her’ are meant.

References

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

    Google Scholar 

  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)

    Google Scholar 

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

    Google Scholar 

  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)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Lin, C.-H., Shan, Y.-C., Wu, I-C.: Tournament framework for computer mahjong competitions. In: 2011 International Conference on Technologies and Applications of Artificial Intelligence (TAAI), pp. 286–291. IEEE (2011)

    Google Scholar 

  7. Scott, D.: The problematic nature of participation in contract bridge: a qualitative study of group-related constraints. Leis. Sci. 13(4), 321–336 (1991)

    Article  Google Scholar 

  8. Tesauro, G.: TD-Gammon, a self-teaching backgammon program, achieves master-level play. Neural Comput. 6(2), 215–219 (1994)

    Article  Google Scholar 

  9. Thompson, K.: Retrograde analysis of certain endgames. ICCA J. 9(3), 131–139 (1986)

    Google Scholar 

  10. Yen, S.-J., Chou, C.-W., Chen, J.-C., Wu, I.-C., Kao, K.-Y.: The art of the Chinese dark chess program diable. In: Chang, R.-S., Jain, L.C., Peng, S.-L. (eds.) Advances in Intelligent Systems and Applications - Volume 1. Smart Innovation, Systems and Technologies, vol. 20, pp. 231–242. Springer, Berlin Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Science, Academia Sinica, Taipei, 115, Taiwan

    Hung-Jui Chang & Tsan-sheng Hsu

Authors
  1. Hung-Jui Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tsan-sheng Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tsan-sheng Hsu .

Editor information

Editors and Affiliations

  1. Tilburg University, Tilburg, The Netherlands

    H. Jaap van den Herik

  2. JAIST, Ishikawa, Japan

    Hiroyuki Iida

  3. Tilburg University, Tilburg, The Netherlands

    Aske Plaat

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Chang, HJ., Hsu, Ts. (2014). A Quantitative Study of \(2 \times 4\) Chinese Dark Chess. In: van den Herik, H., Iida, H., Plaat, A. (eds) Computers and Games. CG 2013. Lecture Notes in Computer Science(), vol 8427. Springer, Cham. https://doi.org/10.1007/978-3-319-09165-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09165-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09164-8

  • Online ISBN: 978-3-319-09165-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation