References

• 1. 1)
     • 26. Zobrist, A.L.: ‘A new hashing method with application for game playing’, ICCA J., 1970, 13, (2), pp. 69–73.
  2. 2)
     • 17. Li, L., Huang, H., Deng, L.: ‘Dynamic opening-book in computer games’. Control and Decision Conf., Mianyang, China, 2011, pp. 3451–3454.
  3. 3)
     • 2. Wang, Y., Qiu, H., Wu, Y.Y., et al: ‘Research and development of computer games’, CAAI Trans. Intell. Syst., 2016, 11, (6), pp. 788–798.
  4. 4)
     • 14. Cazenave, T., Liu, J., Teytaud, F., et al: ‘Learning opening books in partially observable games: using random seeds in Phantom Go’. Computational Intelligence and Games, Santorini Island, Greece, 2016, pp. 1–7.
  5. 5)
     • 24. Audouard, P., Chaslot, G., Hoock J, B., et al: ‘Grid coevolution for adaptive simulations: application to the building of opening books in the game of go’, in ‘Workshops on applications of evolutionary computation’ (Springer, Berlin, Heidelberg, 2009), pp. 323–332.
  6. 6)
     • 4. Bench-Capon, T.J.M., Dunne, P.E.: ‘Argumentation in artificial intelligence’, Artif. Intell., 2007, 171, (10), pp. 619–641.
  7. 7)
     • 5. Samuel, A.L.: ‘Some studies in machine learning using the game of checkers’, in ‘Computers & thought’ (MIT Press, New York, USA, 1995), pp. 206–226.
  8. 8)
     • 7. Li, Y.R., Liu, X.P., Wang, Y.J., et al: ‘A systematic research about the computer game of checkers based on the decision-making of AI’. Control and Decision Conf., Qingdao,China, 2015, pp. 6437–6442.
  9. 9)
     • 27. Cheng, L., Yajie, W., Fei, L., et al: ‘Debugging computer game program using Zobrist hashing’. Control and Decision Conf., Taiyuan, China, 2012, pp. 1514–1517.
  10. 10)
      • 1. Xu, X.H., Deng, Z.L., Wang, J., et al: ‘Challenging issues facing computer game research’, CAAI Trans. Intell. Syst., 2008, 3, (4), pp. 288–293.
  11. 11)
      • 16. Wei, Q.G., Wang, J., Xu, X.H., et al: ‘A study and design of opening-book of computer Chinese chess’, CAAI Trans. Intell. Syst., 2007, 2, (1), pp. 85–89.
  12. 12)
      • 25. Gaudel, R., Hoock J, B., Pérez, J., et al: ‘A principled method for exploiting opening books’, in ‘International conference on computers and games’ (Springer, Berlin, Heidelberg, 2010), pp. 136–144.
  13. 13)
      • 6. An, M.M., Li, S.Q.: ‘An evaluation algorithm of checkers’, J. Beijing Inf. Sci. Technol. Univ., 2017, 32, (2), pp. 85–88.
  14. 14)
      • 9. Zheng, C.S., Jia, L.J., Quan, H., et al: ‘Programming research based on game of checkers’, J. Harbin Univ. Sci. Technol., 2016, 21, (3), pp. 24–28.
  15. 15)
      • 10. Li, Y.R., Liu, X.P., Zhang, H., et al: ‘Study on system modeling and optimization of static evaluation based on the computer game of draughts’. Control and Decision Conf., Yinchuan, China, 2016, pp. 4283–4287.
  16. 16)
      • 22. Donninger, C., Lorenz, U.: ‘Innovative opening-book handling’, in ‘Advances in computer games’ (Springer, Berlin Heidelberg, Germany, 2005), pp. 1–10.
  17. 17)
      • 12. Karapetyan, A., Lorentz, R.J.: ‘Generating an opening book for amazons’, in ‘Computers and games’ (Springer, Berlin Heidelberg, Germany, 2004), pp. 161–174.
  18. 18)
      • 19. Steinmetz, E.S., Gini, M.L.: ‘Mining expert play to guide Monte Carlo search in the opening moves of go’. IJCAI, Buenos Aires, Argentina, 2015, pp. 801–807.
  19. 19)
      • 11. Lincke, T.R.: ‘Strategies for the automatic construction of opening books’, in ‘Revised papers from the second international conference on computers and games’ (Springer, Berlin Heidelberg, Germany, 2000), pp. 74–86.
  20. 20)
      • 13. Schaeffer, J., Culberson, J., Treloar, N., et al: ‘A world championship caliber checkers program’, Artif. Intell., 1992, 53, (2–3), pp. 273–289.
  21. 21)
      • 23. Mullins, J., Drake, P.: ‘Using human knowledge to improve opening strategy in computer go’. Int. Conf. Artificial Intelligence, Atlanta, GA, USA, 2010, pp. 730–734.
  22. 22)
      • 20. Michalowski, M., Boddy M, S., Neilsen, M.: ‘Bayesian learning of generalized board positions for improved move prediction in computer go’. AAAI, 2011.
  23. 23)
      • 15. Steinmetz, E.S.: ‘Computer go and monte carlo tree search: opening book and parallel solutions’, University of Minnesota, 2016.
  24. 24)
      • 21. Buro, M.: ‘Toward opening book learning’, ICCA J., 1999, 22, (2), pp. 98–102.
  25. 25)
      • 8. Liu, X.P., Li, Y.R.: ‘The application study on improved distributed genetic algorithm in computer games’, Trans. Beijing Inst. Technol., 2017, 37, (10), pp. 1019–1023.
  26. 26)
      • 28. Huizhan, L., Chenjun, X., Hongye, L., et al: ‘Hash table in Chinese chess’. Control and Decision Conf., Taiyuan, China, 2012, pp. 3286–3291.
  27. 27)
      • 3. Silver, D., Huang, A., Maddison, C.J., et al: ‘Mastering the game of go with deep neural networks and tree search’, Nature, 2016, 529, (7587), pp. 484–489.
  28. 28)
      • 18. Hong, K., Kim, J., Lee, H., et al: ‘Data-driven computer go based on hadoop’. Advanced Information Networking and Applications Workshops (WAINA), Victoria, Canada, 2014, pp. 347–351.