To Create Intelligent Adaptive Game Opponent by Using Monte-Carlo for Tree Search
暂无分享,去创建一个
Xiao Liu | Yang Chen | Yuan Gao | Suoju He | Yiwen Fu | Jiajian Yang | Donglin Ji
[1] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[2] John Levine,et al. An evolutionary approach for interactive computer games , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).
[3] Georgios N. Yannakakis. AI in computer games : generating interesting interactive opponents by the use of evolutionary computation , 2005 .
[4] Gabriel Kronberger,et al. Bandit-Based Monte-Carlo Planning for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2007, EUROCAST.
[5] Yi Wang,et al. Game Player Strategy Pattern Recognition and How UCT Algorithms Apply Pre-knowledge of Player's Strategy to Improve Opponent AI , 2008, 2008 International Conference on Computational Intelligence for Modelling Control & Automation.
[6] Simon M. Lucas. Computational intelligence and games: Challenges and opportunities , 2008, Int. J. Autom. Comput..