General Game Playing with Stochastic CSP

The challenge of General Game Playing (GGP) is to devise artificial game playing algorithms that take as input the rules of any strategic game, described in the Game Description Language (GDL), and that effectively play without human intervention. The aim of this paper is to address the GGP challenge by casting GDL games (potentially with chance events) into the Stochastic Constraint Satisfaction Problem (SCSP). The stochastic constraint network of a game is decomposed into a sequence of μSCSPs (a.k.a. one-stage SCSP), each of them being associated to a game round. Winning strategies are searched by coupling the MAC algorithm, used to solve each μSCSP in turn, together with the UCB (Upper Confidence Bound) policy for approximating the values of those strategies obtained by the last μSCSP in the sequence. Extensive experiments conducted on various GDL games with different deliberation times per round, demonstrate that the MAC-UCB algorithm significantly outperforms the state-of-the-art UCT (upper confidence bounds for trees) algorithm