Table of Contents Author Guidelines Submit a Manuscript
International Journal of Computer Games Technology
Volume 2016, Article ID 5216861, 14 pages
http://dx.doi.org/10.1155/2016/5216861
Research Article

Turn-Based War Chess Model and Its Search Algorithm per Turn

1College of Computer Science, Chongqing University, Chongqing 400044, China
2Department of Software Engineering, Chongqing Institute of Engineering, Chongqing 400056, China
3College of Automation, Chongqing University, Chongqing 400044, China
4College of International Education, Chongqing University, Chongqing 400044, China
5PetroChina Chongqing Marketing Jiangnan Company, Chongqing 400060, China

Received 20 August 2015; Revised 25 December 2015; Accepted 10 January 2016

Academic Editor: Michela Mortara

Copyright © 2016 Hai Nan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. V. Alus, H. J. van den Herik, and M. P. H. Huntjens, “Go-Moku solved by new search techniques,” Computational Intelligence, vol. 12, no. 1, pp. 7–23, 1996. View at Publisher · View at Google Scholar · View at Scopus
  2. C. Deng, Research on search algorithms in computer go [M.S. thesis], Kunming University of Science and Technology, 2013.
  3. H. C. Neto, R. M. S. Julia, G. S. Caexeta, and A. R. A. Barcelos, “LS-VisionDraughts: improving the performance of an agent for checkers by integrating computational intelligence, reinforcement learning and a powerful search method,” Applied Intelligence, vol. 41, no. 2, pp. 525–550, 2014. View at Publisher · View at Google Scholar · View at Scopus
  4. Y. J. Liu, The research and implementation of computer games which based on the alpha-beta algorithm [M.S. thesis], Dalian Jiaotong University, 2012.
  5. J. Jokić, Izrada šahovskog engine-a [Ph.D. thesis], University of Rijeka, 2014.
  6. N. R. Sturtevant and R. E. Korf, “On pruning techniques for multi-player games,” in Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence (AAAI-IAAI '00), vol. 49, pp. 201–207, Austin, Tex, USA, July-August 2000.
  7. C. Luckhart and K. Irani B, “An algorithmic solution of N-person games,” in Proceedings of the 5th National Conference on Artificial Intelligence (AAAI '86), vol. 1, pp. 158–162, Philadelphia, Pa, USA, August 1986.
  8. C. Browne, “A problem case for UCT,” IEEE Transactions on Computational Intelligence and AI in Games, vol. 5, no. 1, pp. 69–74, 2013. View at Publisher · View at Google Scholar · View at Scopus
  9. M. H. M. Winands, Y. Björnsson, and J.-T. Saito, “Monte Carlo tree search in lines of action,” IEEE Transactions on Computational Intelligence and AI in Games, vol. 2, no. 4, pp. 239–250, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. P. Nijssen and M. H. M. Winands, “Monte carlo tree search for the hide-and-seek game Scotland Yard,” IEEE Transactions on Computational Intelligence and AI in Games, vol. 4, no. 4, pp. 282–294, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. G. Wang, H. Liu, and N. Zhu, “A survey of war games technology,” Ordnance Industry Automation, vol. 31, no. 8, pp. 38–41, 2012. View at Google Scholar
  12. M. H. Bergsma and P. Spronck, “Adaptive spatial reasoning for turn-based strategy games,” in Proceedings of the 4th Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE '08), pp. 161–166, Palo Alto, Calif, USA, October 2008.
  13. S. Paskaradevan and J. Denzinger, “A hybrid cooperative behavior learning method for a rule-based shout-ahead architecture,” in Proceedings of the IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology (WI-IAT '12), vol. 2, pp. 266–273, IEEE Computer Society, December 2012.
  14. S. Wiens, J. Denzinger, and S. Paskaradevan, “Creating large numbers of game AIs by learning behavior for cooperating units,” in Proceedings of the IEEE Conference on Computational Intelligence in Games (CIG '13), pp. 1–8, IEEE, Ontario, Canada, August 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. G. Badhrinathan, A. Agarwal, and R. Anand Kumar, “Implementation of distributed chess engine using PaaS,” in Proceedings of the International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM '12), pp. 38–42, IEEE, Dubai, United Arab Emirates, December 2012. View at Publisher · View at Google Scholar · View at Scopus
  16. X. Xu and C. Xu, “Summarization of fundamental and methodology of computer games,” Progress of Artificial Intelligence in China, pp. 748–759, 2009. View at Google Scholar
  17. J. Song and M. Muller, “An enhanced solver for the game of Amazons,” IEEE Transactions on Computational Intelligence and AI in Games, vol. 7, no. 1, pp. 16–27, 2015. View at Publisher · View at Google Scholar
  18. D. Gesang, Y. Wang, and X. Guo, “AI arithmetic design and practical path of a war-chess game,” Journal of Tibet University (Natural Science Edition), vol. 26, no. 2, pp. 102–106, 2011. View at Google Scholar
  19. X. Xu and J. Wang, “Key technologies analysis of Chinese chess computer game,” Mini-Micro Systems, vol. 27, no. 6, pp. 961–969, 2006. View at Google Scholar
  20. B. Bošanský, V. Lisý, J. Čermák, R. Vítek, and M. Pěchouček, “Using double-oracle method and serialized alpha-beta search for pruning in simultaneous move games,” in Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp. 48–54, AAAI Press, Beijing, China, August 2013.
  21. A. Guez, D. Silver, and P. Dayan, “Scalable and efficient Bayes-adaptive reinforcement learning based on Monte-Carlo tree search,” Journal of Artificial Intelligence Research, vol. 48, pp. 841–883, 2013. View at Google Scholar · View at MathSciNet · View at Scopus
  22. R. Sedgewick, “Permutation generation methods,” ACM Computing Surveys, vol. 9, no. 2, pp. 137–164, 1977. View at Publisher · View at Google Scholar
  23. D. E. Knuth, The Art of Computer Programming Vol. 4A: Combinatorial Algorithms, Part 1, The People's Posts and Telecommunications Press, Beijing, China, 2012.
  24. B. R. Heap, “Permutations by interchanges,” The Computer Journal, vol. 6, no. 3, pp. 293–298, 1963. View at Publisher · View at Google Scholar
  25. F. M. Ives, “Permutation enumeration: four new permutation algorithms,” Communications of the ACM, vol. 19, no. 2, pp. 68–72, 1976. View at Publisher · View at Google Scholar · View at Scopus
  26. G. Sharon, R. Stern, M. Goldenberg, and A. Felner, “The increasing cost tree search for optimal multi-agent pathfinding,” Artificial Intelligence, vol. 195, pp. 470–495, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus