The Efficiency of the HyperPlay Technique Over Random Sampling

We show that the HyperPlay technique, which maintains a bag of updatable models for sampling an imperfect-information game, is more efficient than taking random samples of play sequences. Also, we demonstrate that random sampling may become impossible under the practical constraints of a game. We show the HyperPlay sample can become biased and not uniformly distributed across an information set and present a remedy for this bias, showing the impact on game results for biased and unbiased samples. We extrapolate the use of the technique beyond General Game Playing and in particular for enhanced security games with in-game percepts to facilitate a flexible defense response.

[1]  Michael Thielscher,et al.  The Scalability of the HyperPlay Technique for Imperfect-Information Games , 2016, AAAI Workshop: Computer Poker and Imperfect Information Games.

[2]  Michael H. Bowling,et al.  Counterfactual Regret Minimization in Sequential Security Games , 2016, AAAI.

[3]  Michael Thielscher,et al.  A General Game Description Language for Incomplete Information Games , 2010, AAAI.

[4]  Neil Burch,et al.  Heads-up limit hold’em poker is solved , 2015, Science.

[5]  Michael R. Genesereth,et al.  General Game Playing: Overview of the AAAI Competition , 2005, AI Mag..

[6]  Michael Thielscher,et al.  HyperPlay: A Solution to General Game Playing with Imperfect Information , 2012, AAAI.

[7]  Stefan Edelkamp,et al.  Searching with Partial Belief States in General Games with Incomplete Information , 2012, KI.

[8]  Peter I. Cowling,et al.  Information Set Monte Carlo Tree Search , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[9]  Branislav Bosanský,et al.  Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies , 2015, AAAI.

[10]  Stephan Schiffel,et al.  Representing and Reasoning About the Rules of General Games With Imperfect Information , 2014, J. Artif. Intell. Res..

[11]  Mark Richards,et al.  Information Set Generation in Partially Observable Games , 2012, AAAI.

[12]  Michael Thielscher,et al.  Lifting Model Sampling for General Game Playing to Incomplete-Information Models , 2015, AAAI.

[13]  Milind Tambe,et al.  TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems , 2012, IAAI.

[14]  Ian Frank.  Search in Games with Incomplete Information , 1998 .

[15]  James E. Clune,et al.  Heuristic Evaluation Functions for General Game Playing , 2007, KI - Künstliche Intelligenz.

[16]  Joel Veness,et al.  Monte-Carlo Planning in Large POMDPs , 2010, NIPS.