Chapter

Advances in Intelligent Systems and Applications - Volume 1

Volume 20 of the series Smart Innovation, Systems and Technologies pp 231-242

The Art of the Chinese Dark Chess Program DIABLE

  • Shi-Jim YenAffiliated withDept. of Computer Science and Information Engineering, National Dong Hwa University Email author 
  • , Cheng-Wei ChouAffiliated withDept. of Computer Science and Information Engineering, National Dong Hwa University
  • , Jr-Chang ChenAffiliated withDept. of Applied Mathematics, Chung Yuan Christian University
  • , I-Chen WuAffiliated withDept. of Computer Science, National Chiao Tung University
  • , Kuo-Yuan KaoAffiliated withDept. of Information Management, National Penghu University

* Final gross prices may vary according to local VAT.

Get Access

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