Cited By
View all- Sombat WRohlfshagen PLucas S(2012)Evaluating the enjoyability of the ghosts in Ms Pac-Man2012 IEEE Conference on Computational Intelligence and Games (CIG)10.1109/CIG.2012.6374180(379-387)Online publication date: Sep-2012
Towards more intelligent adaptive video game agents: a computational intelligence perspective
Pages 293 - 298
Abstract
This paper provides a computational intelligence perspective on the design of intelligent video game agents. The paper explains why this is an interesting area to research, and outlines the most promising approaches to date, including evolution, temporal difference learning and Monte Carlo Tree Search. Strengths and weaknesses of each approach are identified, and some research directions are outlined that may soon lead to significantly improved video game agents with lower development costs.
References
[1]
Arneson, B., Hayward, R.B. and Henderson, P., 2010, Monte Carlo Tree Search in Hex, IEEE Transactions on Computational Intelligence and AI in Games, vol.2, no. 4, pp.251--258.
[2]
H. Baier and P. D. Drake, 2010, The power of forgetting: Improving the last good reply policy in Monte Carlo Go, IEEE Transactions on Computational Intelligence and AI in Games, vol. 2, no. 4, pp. 303--309.
[3]
Browne, C., Powley, E., Whitehouse, D., Lucas, S., Cowling, P., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S., 2012, A Survey of Monte Carlo Tree Search Methods, IEEE Transactions on Computational Intelligence and AI in Games, vol. 4, no. 1, pp.1--43.
[4]
Cazenave, T., 2012, Monte Carlo Beam Search, IEEE Transactions on Computational Intelligence and AI in Games, vol.4, no. 1, pp.68--72, (2012)
[5]
Enzenberger, M., Müller, M., Arneson, B., Segal, R., 2010, 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, vol.2, no.4, pp.259--270.
[6]
Y. Bjornsson and H. Finnsson, 2009, Cadiaplayer: A simulation-based general game player, IEEE Transactions on Computational Intelligence and AI in Games, vol. 1, no. 1, pp. 4 --15.
[7]
M. R. Genesereth, N. Love, and B. Pell, 2005, General game playing: Overview of the AAAI competition, AI Magazine, no. 2, p. 62 - 72.
[8]
N. Hansen, S. Mueller, and P. Koumoutsakos, 2003, Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES), Evolutionary Computation, vol. 11, pp. 1--18.
[9]
L. Kocsis and C. Szepesvári, 2006, Bandit based Monte-Carlo planning, in Proceedings of European Conference on Machine Learning, Berlin, Germany, pp. 282--293.
[10]
Lucas, S.M., 2010, Estimating Learning Rates in Evolution and TDL: Results on a Simple Grid-World Problem, IEEE Conference on Computational Intelligence and Games, pp. 372--379.
[11]
Lucas, S.M., 2008, Investigating Learning Rates for Evolution and Temporal Difference Learning, IEEE Symposium on Computational Intelligence and Games.
[12]
Lucas, S.M., 2008, Computational Intelligence and Games: Challenges and Opportunities, International Journal of Automation and Computing, vol. 5, pages: 45 -- 57.
[13]
Lucas, S.M. and Kendall, G., 2006, Evolutionary Computation and Games, IEEE Computational Intelligence Magazine, vol. 1, pages: 10 -- 18.
[14]
Méhat, J. and Cazenave, T., 2010, Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing, IEEE Transactions on Computational Intelligence and AI in Games vol. 2, pp. 271--277.
[15]
Perez, D., Rohlfshagen, R. and Lucas, S.M., 2012, The Physical Travelling Salesman Problem: WCCI 2012 Competition, IEEE Congress on Evolutionary Computation, to appear.
[16]
Perez, D., Rohlfshagen, R. and Lucas, S.M., 2012, Monte-Carlo Tree Search for the Physical Travelling Salesman Problem, Proceedings of EvoGames, to appear.
[17]
Robles, D, Rohlfshagen, P and Lucas, S.M., 2011, Learning Non-Random Moves for Playing Othello: Improving Monte Carlo Tree Search, IEEE Conference on Computational Intelligence and Games, pp. 305 -- 312.
[18]
Silver, D, Sutton, R.S. and Müller, M., 2008, Sample-based learning and search with permanent and transient memories, in Proceedings of 25th Annual International Conference on Machine Learning, Helsinki, Finland, pp. 968--975.
[19]
Togelius, J. and Schmidhuber, J., 2008, An Experiment in Automatic Game Design. Proceedings of the IEEE Symposium on Computational Intelligence and Games (CIG), 111--118.
[20]
Togelius, J., Yannakakis, G.N., Stanley, K.O. and Browne, C., 2011, Search-Based Procedural Content Generation: A Taxonomy and Survey, IEEE Transactions on Computational Intelligence and AI in Games, vol.3, no.3, pp.172--186.
Index Terms
- Towards more intelligent adaptive video game agents: a computational intelligence perspective
Recommendations
Optimizing Hearthstone agents using an evolutionary algorithm
AbstractDigital collectible card games are not only a growing part of the video game industry, but also an interesting research area for the field of computational intelligence. This game genre allows researchers to deal with hidden ...
Towards the Synergy of Cognitive Informatics, Neural Informatics, Brain Informatics, and Cognitive Computing
The contemporary wonder of sciences and engineering recently refocused on the starting point: how the brain processes internal and external information autonomously rather than imperatively as those of conventional computers? This paper explores the ...
AI in China: A Survey
This article consists of nine short essays discussing research pursued by AI researchers in China and their perspectives on research in several AI subareas. The article first introduces the mechanization of mathematics, an area in which Chinese ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
May 2012
320 pages
ISBN:9781450312158
DOI:10.1145/2212908
- General Chair:
- John Feo,
- Program Chairs:
- Paolo Faraboschi,
- Oreste Villa
Copyright © 2012 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 15 May 2012
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
CF'12
Sponsor:
Acceptance Rates
Overall Acceptance Rate 273 of 785 submissions, 35%
Upcoming Conference
CF '25
- Sponsor:
- sigmicro
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 294Total Downloads
- Downloads (Last 12 months)14
- Downloads (Last 6 weeks)1
Reflects downloads up to 18 Nov 2024
Other Metrics
Citations
Cited By
View all- Sombat WRohlfshagen PLucas S(2012)Evaluating the enjoyability of the ghosts in Ms Pac-Man2012 IEEE Conference on Computational Intelligence and Games (CIG)10.1109/CIG.2012.6374180(379-387)Online publication date: Sep-2012
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in