DocumentCode :
1572771
Title :
Finding robust strategies to defeat specific opponents using case-injected coevolution
Author :
Ballinger, Christopher ; Louis, Sushil
Author_Institution :
Univ. of Nevada, Reno, Reno, NV, USA
fYear :
2013
Firstpage :
1
Lastpage :
8
Abstract :
Finding robust solutions that are also capable of beating specific opponents presents a challenging problem. This paper investigates solving this problem by using case-injection with a coevolutionary algorithm. Specifically, we recorded winning strategies used by a human player against a coevolved strategy and then injected the player´s strategies into the coevolutionary teachset. We compare the strategies produced by case-injected coevolution to strategies produced by a genetic algorithm that only evaluated against the player´s strategies. In this paper, our results show that genetic algorithms do not work well against sufficiently difficult opponents. However, coevolution eventually learns to defeat these opponents by first bootstrapping strategies that work well in general, which drives the population closer to strategies that can defeat the challenging opponent. This work informs our research on finding robust real-time strategy game players that also defeat specific opponents.
Keywords :
computer games; evolutionary computation; learning (artificial intelligence); bootstrapping strategy; case-injected coevolution; coevolutionary algorithm; coevolutionary teachset; coevolved strategy; genetic algorithm; human player; player strategy; real-time strategy game players; robust strategy finding; winning strategy; Artificial intelligence; Biological cells; Games; Genetic algorithms; Robustness; Sociology; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence in Games (CIG), 2013 IEEE Conference on
Conference_Location :
Niagara Falls, ON
ISSN :
2325-4270
Print_ISBN :
978-1-4673-5308-3
Type :
conf
DOI :
10.1109/CIG.2013.6633656
Filename :
6633656
Link To Document :
بازگشت