Mining game logs to create a playbook for unit AIs

We present a method for mining game logs for plays, sequences of actions for a group of units achieving an objective with a high likelihood and in many logs. The mining moves through a log backwards, identifying states that achieve the objective and taking this state and certain surrounding ones as a play candidate. After filtering out irrelevant information and too costly candidates, we cluster similar candidates and abstract the candidates in large enough clusters into a play. We applied these general ideas to the game Battle for Wesnoth and our evaluation showed that we are able to consistently mine successful plays, some of which are also often applied in logs that were not used for the mining.

[1]  Hsing-Kuo Kenneth Pao,et al.  Game bot identification based on manifold learning , 2008, NETGAMES.

[2]  Christian Bauckhage,et al.  Guns, swords and data: Clustering of player behavior in computer games in the wild , 2012, 2012 IEEE Conference on Computational Intelligence and Games (CIG).

[3]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[4]  Jörg Denzinger,et al.  Improving testing of multi-unit computer players for unwanted behavior using coordination macros , 2009, 2009 IEEE Symposium on Computational Intelligence and Games.

[5]  Jörg Denzinger,et al.  Learning cooperative behavior for the shout-ahead architecture , 2014, Web Intell. Agent Syst..

[6]  Bernhard Bauer,et al.  Improving the Efficiency of Self-Organizing Emergent Systems by an Advisor , 2010, 2010 Seventh IEEE International Conference and Workshops on Engineering of Autonomic and Autonomous Systems.

[7]  Julian Togelius,et al.  Game Data Mining , 2013, Game Analytics, Maximizing the Value of Player Data.

[8]  Philip S. Yu,et al.  Mining high utility episodes in complex event sequences , 2013, KDD.

[9]  P. Rousseeuw Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , 1987 .

[10]  L. Jennings,et al.  Guns , 1976 .