Skip to main content

The Art of the Chinese Dark Chess Program DIABLE

  • Conference paper
Advances in Intelligent Systems and Applications - Volume 1

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 20))

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borsboom, J., Saito, J., Chaslot, G., Uiterwijk, J.: A comparison of Monte-Carlo methods for Phantom Go. In: Proc. 19th Belgian–Dutch Conference on Artificial Intelligence – BNAIC, Utrecht, The Netherlands (2007)

    Google Scholar 

  2. Van den Broeck, G., Driessens, K., Ramon, J.: Monte-Carlo Tree Search in Poker Using Expected Reward Distributions. In: Zhou, Z.-H., Washio, T. (eds.) ACML 2009. LNCS (LNAI), vol. 5828, pp. 367–381. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Browne, C., Powley, E., Whitehouse, D., Lucas, S., Cowling, P., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo Tree Search. IEEE Transactions on Computational Intelligence and AI in Games 4(1) (March 2012)

    Google Scholar 

  4. Chaslot, G.M.J.-B., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bouzy, B.: Progressive strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation 4(3), 343–357 (2008)

    Google Scholar 

  5. Chen, B.N., Shen, B.-J., Hsu, T.S.: Chinese Dark Chess. ICGA Journal 33(2), 93–106 (2010)

    Google Scholar 

  6. Chen, J.-C., Lin, T.-Y., Hsu, S.-C., Hsu, T.-S.: Design and Implementation of Computer Chinese Dark Chess Endgame Database. In: Proceeding of TCGA Workshop 2012, Hualien, Taiwan, pp. 5–9 (2012)

    Google Scholar 

  7. Chou, C.-W., Yen, S.-J., Wu, I.-C.: TAAI 2011 Computer Go Tournaments. ICGA Journal 34(4), 251–252 (2011)

    Google Scholar 

  8. Ciancarini, P., Favini, G.P.: Monte Carlo tree search in Kriegspiel. Artificial Intelligence 174, 670–684 (2010)

    Google Scholar 

  9. Enzenberger, M., Müller, M., Arneson, B., Segal, R.: Fuego - An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search. IEEE Transactions on Computational Intelligence and AI in Games 2(4), 259–270 (2010)

    Google Scholar 

  10. Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with patterns in Monte-Carlo Go (Technical Report 6062). INRIA (2006)

    Google Scholar 

  11. Gelly, S., Silver, D.: Monte-Carlo tree search and rapid action value estimation in computer Go. Artificial Intelligence 175(11), 1856–1875 (2011)

    Article  MathSciNet  Google Scholar 

  12. Van den Broeck, G., Driessens, K., Ramon, J.: Monte-Carlo Tree Search in Poker Using Expected Reward Distributions. In: Zhou, Z.-H., Washio, T. (eds.) ACML 2009. LNCS, vol. 5828, pp. 367–381. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Kloetzer, J., Iida, H., Bouzy, B.: The Monte-Carlo Approach in Amazons. In: Proceedings of the Computer Games Workshop 2007 (CGW 2007), Amsterdam, The Netherlands, pp. 185–192 (2007)

    Google Scholar 

  14. Kocsis, L., Szepesvari, C.: Bandit based Monte-Carlo planning. In: 15th European Conference on Machine Learning, pp. 282–293 (2006)

    Google Scholar 

  15. Lai, S.-C.: Research and Implementation of Computer Dark Chess Program with Heuristics, National Dong Hwa University, Matser thesis (2008) (in Chinese)

    Google Scholar 

  16. Van Lishout, F., Chaslot, G., Uiterwijk, J.: Monte-Carlo Tree Search in Backgammon. In: Proceedings of the Computer Games Workshop 2007 (CGW 2007), Amsterdam, The Netherlands, pp. 175–184 (2007)

    Google Scholar 

  17. Lou, W.-C.: Artificial Intelligence Improvement of Chinese Dark Chess, National Taiwan Normal University, Master thesis (2011) (in Chinese)

    Google Scholar 

  18. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice Hall (2003)

    Google Scholar 

  19. Shieh, Y.-A.: The Design and Implementation of Computer Dark Chess, National Taiwan Normal University, Master thesis (2008) (in Chinese)

    Google Scholar 

  20. Shih, H.-C., Lin, S.-S.: The Design and Implementation of Computer Dark Chess. In: Proceeding of TCGA Workshop 2012, Hualien, Taiwan, pp. 29–36 (2012) (in Chinese)

    Google Scholar 

  21. Veness, J., Ng, K.S., Hutter, M., Uther, W., Silver, D.: A Monte-Carlo AIXI Approximation. J. Artif. Intell. Res. 40, 95–142 (2011)

    MathSciNet  MATH  Google Scholar 

  22. Yang, J.-K., Su, T.-C., Wu, I.-C.: TCGA 2012 Computer Game Tournament Report. Submitted to ICGA Journal (2012)

    Google Scholar 

  23. Yen, S.-J., Su, T.-C., Wu, I.-C.: The TCGA 2011 Computer-Games Tournament. ICGA Journal 34(2), 108–110 (2011)

    Google Scholar 

  24. Yen, S.-J., Chiu, S.-Y., Wu, I.-C.: Modark Wins Chinese Dark Chess Tournament. ICGA Journal 33(4), 230–231 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shi-Jim Yen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-35452-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35452-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35451-9

  • Online ISBN: 978-3-642-35452-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics