{"title":"Personality profiles for generating believable bot behaviors","authors":"Casey Rosenthal, C. Congdon","doi":"10.1109/CIG.2012.6374147","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374147","url":null,"abstract":"In this work, personality profiles are used to develop parameterized bot behaviors. While the personality profile structure was originally designed as a descriptive tool for human behavior, as used here it is a generative tool, allowing a plurality of different behaviors to result from a single rule set. This paper describes our use of the Five-Factor Model of personality to develop a bot that plays Unreal Tournament 2004, as an entry in the 2K BotPrize competition at the 2010 IEEE Computational Intelligence and Games conference.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124414990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"FRIGHT: A flexible rule-based intelligent ghost team for Ms. Pac-Man","authors":"D. Gagne, C. Congdon","doi":"10.1109/CIG.2012.6374166","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374166","url":null,"abstract":"FRIGHT is a rule-based intelligent agent for playing the ghost team in the Ms. Pac-Man vs Ghosts Competition held at the 2012 IEEE Conference on Computational Intelligence and Games. FRIGHT uses rule sets with high-level abstractions of the game state and actions, and employs evolutionary computation to learn rule sets; a distributed homogenous-agent approach is used. We compare the performance of a hand-coded rule set to one learned by the system and find that the rule set learned by the system outperforms the hand-coded rules.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117110795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Anders Drachen, R. Sifa, C. Bauckhage, Christian Thurau
{"title":"Guns, swords and data: Clustering of player behavior in computer games in the wild","authors":"Anders Drachen, R. Sifa, C. Bauckhage, Christian Thurau","doi":"10.1109/CIG.2012.6374152","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374152","url":null,"abstract":"Behavioral data from computer games can be exceptionally high-dimensional, of massive scale and cover a temporal segment reaching years of real-time and a varying population of users. Clustering of user behavior provides a way to discover behavioral patterns that are actionable for game developers. Interpretability and reliability of clustering results is vital, as decisions based on them affect game design and thus ultimately revenue. Here case studies are presented focusing on clustering analysis applied to high-dimensionality player behavior telemetry, covering a combined total of 260,000 characters from two major commercial game titles: the Massively Multiplayer Online Role-Playing Game Tera and the multi-player strategy war game Battlefield 2: Bad Company 2. K-means and Simplex Volume Maximization clustering were applied to the two datasets, combined with considerations of the design of the games, resulting in actionable behavioral profiles. Depending on the algorithm different insights into the underlying behavior of the population of the two games are provided.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125776321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Update rules, reciprocity and weak selection in evolutionary spatial games","authors":"G. Greenwood, P. Avery","doi":"10.1109/CIG.2012.6374132","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374132","url":null,"abstract":"Cooperation in nature is a complex topic and its study has left scientists with many open questions. Over the past two decades research has been undertaken into how cooperation works in an evolutionary context and how we can emulate it for social analysis. Numerous computer models have been developed and analyzed, with many models formulated as spatial or network games. These games use various update rules to evolve cooperative strategies. Despite two decades of effort, arguably little progress has been made. This paper exposes some of the problems with these spatial and network games and shows why they are ill-suited to get any real answers. Recommendations on future research directions that might provide some insight are presented.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123551526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Beam Monte-Carlo Tree Search","authors":"Hendrik Baier, M. Winands","doi":"10.1109/CIG.2012.6374160","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374160","url":null,"abstract":"Monte-Carlo Tree Search (MCTS) is a state-of-the-art stochastic search algorithm that has successfully been applied to various multi- and one-player games (puzzles). Beam search is a search method that only expands a limited number of promising nodes per tree level, thus restricting the space complexity of the underlying search algorithm to linear in the tree depth. This paper presents Beam Monte-Carlo Tree Search (BMCTS), combining the ideas of MCTS and beam search. Like MCTS, BMCTS builds a search tree using Monte-Carlo simulations as state evaluations. When a predetermined number of simulations has traversed the nodes of a given tree depth, these nodes are sorted by their estimated value, and only a fixed number of them is selected for further exploration. In our experiments with the puzzles SameGame, Clickomania and Bubble Breaker, BMCTS significantly outperforms MCTS at equal time controls. We show that the improvement is equivalent to an up to four-fold increase in computing time for MCTS.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126411131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Imitating play from game trajectories: Temporal difference learning versus preference learning","authors":"T. Runarsson, S. Lucas","doi":"10.1109/CIG.2012.6374141","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374141","url":null,"abstract":"This work compares the learning of linear evaluation functions using preference learning versus least squares temporal difference learning, LSTD(λ), from samples of game trajectories. The game trajectories are taken from human competitions held by the French Othello Federation1. The raw board positions are used to create a linear evaluation function to illustrate the key difference between the two learning approaches. The results show that the policies learned, using exactly the same game trajectories, can be quite different. For the simple set of features used, preference learning produces policies that better capture the behaviour of expert players, and also lead to higher levels of play when compared to LSTD(λ).","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132507347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Quentin Gemine, Firas Safadi, R. Fonteneau, D. Ernst
{"title":"Imitative learning for real-time strategy games","authors":"Quentin Gemine, Firas Safadi, R. Fonteneau, D. Ernst","doi":"10.1109/CIG.2012.6374186","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374186","url":null,"abstract":"Over the past decades, video games have become increasingly popular and complex. Virtual worlds have gone a long way since the first arcades and so have the artificial intelligence (AI) techniques used to control agents in these growing environments. Tasks such as world exploration, constrained pathfinding or team tactics and coordination just to name a few are now default requirements for contemporary video games. However, despite its recent advances, video game AI still lacks the ability to learn. In this paper, we attempt to break the barrier between video game AI and machine learning and propose a generic method allowing real-time strategy (RTS) agents to learn production strategies from a set of recorded games using supervised learning. We test this imitative learning approach on the popular RTS title StarCraft II® and successfully teach a Terran agent facing a Protoss opponent new production strategies.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134396469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tróndur Justinussen, P. Rasmussen, Alessandro Canossa, J. Togelius
{"title":"Resource systems in games: An analytical approach","authors":"Tróndur Justinussen, P. Rasmussen, Alessandro Canossa, J. Togelius","doi":"10.1109/CIG.2012.6374153","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374153","url":null,"abstract":"We describe an approach to using standard data mining algorithms to help analyse recurring themes in game design across several games, and to help suggest novel game design ideas. This is illustrated with the analysis of 119 different resource systems across 20 games. Clustering is used to validate the assignment of resources into archetypes; frequent pattern mining is used to find commonly co-occurring resource attributes; and decision tree induction is used to visualize the relations between resource archetypes. We discuss the relation between qualitative and quantitative analysis of game design and suggest that qualitative analysis is necessary but that quantitative methods can be of invaluable help.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114433445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jay Young, F. Smith, C. Atkinson, Ken Poyner, Tom Chothia
{"title":"SCAIL: An integrated Starcraft AI system","authors":"Jay Young, F. Smith, C. Atkinson, Ken Poyner, Tom Chothia","doi":"10.1109/CIG.2012.6374188","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374188","url":null,"abstract":"We present the work on our integrated AI system SCAIL, which is capable of playing a full round of the Real-Time Strategy game Starcraft. Our system makes use of modern AI techniques such as particle filtering, on-line machine learning, drive-based motivation systems and artificial emotions, used to find novel structure in the dynamic playing environment, which is exploited by both high and low-level control systems. We employ a principled architecture, capable of expressing high level goal-directed behaviour. We provide an overview of our system, and a comparative evaluation against the in-game AIs of Starcraft, as well as thirteen third party systems. We go on to detail how the techniques and tools we introduce provide advantages to our system over the current state-of-the-art, resulting in improved performance when competing against those systems.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117176146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evolving spaceship designs for optimal control and the emergence of interesting behaviour","authors":"S. A. Roberts, S. Lucas","doi":"10.1109/CIG.2012.6374175","DOIUrl":"https://doi.org/10.1109/CIG.2012.6374175","url":null,"abstract":"This paper investigates the evolution of spaceship designs given three different fitness functions: one based on specified design objectives, and two simulation-based measures that assess how well a simple controller is able to steer the ships over a number of courses. We use a simple but well-grounded physics model which accounts for the mass of the components and their moments of inertia: the position of thrusters impacts on the linear and angular acceleration that the ship is capable of. We show that evolution is able to generate effective ship designs in this space and that the simple controller generates some interesting behaviours. The evolved ships could be used as a source of diverse alien ships in 2D arcade-style video games.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132704331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}