• DocumentCode
    508389
  • Title

    To Create Intelligent Adaptive Game Opponent by Using Monte-Carlo for Tree Search

  • Author

    Yang, Jiajian ; Gao, Yuan ; He, Suoju ; Liu, Xiao ; Fu, Yiwen ; Chen, Yang ; Ji, Donglin

  • Volume
    5
  • fYear
    2009
  • fDate
    14-16 Aug. 2009
  • Firstpage
    603
  • Lastpage
    607
  • Abstract
    Adaptive Game AI improves adaptability of opponent AI as well as the challenge level of the game play; as a result the entertainment of game is augmented. The most updated algorithm of MCT (Monte-Carlo for Trees) which perform excellent in computer go can be used to achieve excellent result to control non-player characters (NPCs) in video games. In this paper, the prey and predator game genre of Dead End is used as a test-bed, the basic principle of MCT is presented, and the effectiveness of it sapplication to game AI development is demonstrated. Furthermore, by using the construction of ANN (Artificial Neural Network) trained by the data collected from Monte-Carlo Method, the validation of effectiveness and efficiency of the approach is presented. Finally, an approach of combine both the two techniques is discussed to create the intelligent adaptive game opponent.
  • Keywords
    Application software; Artificial intelligence; Artificial neural networks; Dogs; Games; Helium; Law; Legal factors; Telecommunication computing; Testing; Adaptive Game AI; Dead End; MCT; Monte-Carlo;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation, 2009. ICNC '09. Fifth International Conference on
  • Conference_Location
    Tianjian, China
  • Print_ISBN
    978-0-7695-3736-8
  • Type

    conf

  • DOI
    10.1109/ICNC.2009.710
  • Filename
    5367088