The Art of the Chinese Dark Chess Program DIABLE

  • Shi-Jim Yen
  • Cheng-Wei Chou
  • Jr-Chang Chen
  • I-Chen Wu
  • Kuo-Yuan Kao
Conference paper

DOI: 10.1007/978-3-642-35452-6_25

Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 20)
Cite this paper as:
Yen SJ., Chou CW., Chen JC., Wu IC., Kao KY. (2013) The Art of the Chinese Dark Chess Program DIABLE. In: Chang RS., Jain L., Peng SL. (eds) Advances in Intelligent Systems and Applications - Volume 1. Smart Innovation, Systems and Technologies, vol 20. Springer, Berlin, Heidelberg

Abstract

Diable is a famous Chinese dark chess program, which won the Chinese dark chess tournaments in TAAI 2011, TCGA 2011, and TCGA2012 computer game tournaments. Chinese dark chess is an old and very popular game in Chinese culture sphere. This game is played with imperfect information. Most computer Chinese dark chess programs used alpha-beta search with chance nodes to deal with the imperfect information. Diable used a new nondeterministic Monte Carlo tree search model for Chinese dark chess. These tournament results show that the nondeterministic Monte Carlo tree search is promising for Chinese dark chess.

Keywords

Chinese dark chess Monte Carlo tree search Chance node Partially observable games Nondeterministic action 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Shi-Jim Yen
    • 1
  • Cheng-Wei Chou
    • 1
  • Jr-Chang Chen
    • 2
  • I-Chen Wu
    • 3
  • Kuo-Yuan Kao
    • 4
  1. 1.Dept. of Computer Science and Information EngineeringNational Dong Hwa UniversityHualienTaiwan
  2. 2.Dept. of Applied MathematicsChung Yuan Christian UniversityJhongliTaiwan
  3. 3.Dept. of Computer ScienceNational Chiao Tung UniversityHsinchuTaiwan
  4. 4.Dept. of Information ManagementNational Penghu UniversityPenghuTaiwan

Personalised recommendations