{"type":"ScholarlyArticle","title":"Constraint-Based Symmetry Detection in General Game Playing","authors":[{"name":"Frédéric Koriche","slug":"frederic-koriche","given":"Frédéric","family":"Koriche","affiliation":"CNRS UMR 8188 , Université d'Artois , France"},{"name":"Sylvain Lagrue","slug":"sylvain-lagrue","given":"Sylvain","family":"Lagrue","affiliation":"CNRS UMR 8188 , Université d'Artois , France"},{"name":"Éric Piette","slug":"eric-piette","given":"Éric","family":"Piette","affiliation":"CNRS UMR 8188 , Université d'Artois , France"},{"name":"Sébastien Tabary","slug":"sebastien-tabary","given":"Sébastien","family":"Tabary","affiliation":"CNRS UMR 8188 , Université d'Artois , France"}],"abstract":"Symmetry detection is a promising approach for reducing the search tree of games. In General Game Playing (GGP), where any game is compactly represented by a set of rules in the Game Description Language (GDL), the state-of-the-art methods for symmetry detection rely on a rule graph associated with the GDL description of the game. Though such rule-based symmetry detection methods can be applied to various tree search algorithms, they cover only a limited number of symmetries which are apparent in the GDL description. In this paper, we develop an alternative approach to symmetry detection in stochastic games that exploits constraint programming techniques. The minimax optimization problem in a GDL game is cast as a stochastic constraint satisfaction problem (SCSP), which can be viewed as a sequence of one-stage SCSPs. Minimax symmetries are inferred according to themicrostructure complement of these one-stage constraint networks. Based on a theoretical analysis of this approach, we experimentally show on various games that the recent stochastic constraint solver MAC-UCB, coupled with constraint-based symmetry detection, significantly outperforms the standard Monte Carlo Tree Search algorithms, coupled with rule-based symmetry detection. This constraint-driven approach is also validated by the excellent results obtained by our player during the last GGP competition.","doi":"10.24963/ijcai.2017/40","url":"https://ijcai.org/proceedings/2017/40","pdf":"https://ijcai.org/proceedings/2017/0040.pdf","markdown":"https://ijcai.org/proceedings/2017/40.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/40","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":40,"pages":{"first":280,"last":287},"keywords":["Agent-based and Multi-agent Systems: Noncooperative Games","Constraints and Satisfiability: Constraint Optimisation","Agent-based and Multi-agent Systems: Multi-agent Planning"],"videos":[],"references":[{"position":1,"raw":"[Ben-Eliyahu and Dechter, 1994] Rachel Ben-Eliyahu and Rina Dechter. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12(1-2):53-87, 1994.","title":"Propositional semantics for disjunctive logic programs","authors":"Ben-Eliyahu Dechter, Rachel Ben-Eliyahu, Rina Dechter","year":"1994","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Cazenave, 2015] Tristan Cazenave. Generalized rapid action value estimation. In Proceedings of IJCAI, pages 754-760, 2015.","title":"Generalized rapid action value estimation","authors":"Tristan Cazenave, Cazenave","year":"2015","venue":"Proceedings of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/112"},{"position":3,"raw":"[Clark, 1978] Keith L. Clark. Negation as failure. In Logic and Databases, pages 293-322. Plenum Press, 1978.","title":"Negation as failure","authors":"Keith L Clark","year":"1978","venue":"Logic and Databases","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cohen et al., 2006] David Cohen, Peter Jeavons, Christo- pher Jefferson, Karen E. Petrie, and Barbara M. Smith. Symmetry definitions for constraint satisfaction problems. Constraints, 11(2-3):115-137, 2006.","title":"Symmetry definitions for constraint satisfaction problems","authors":"David Cohen, Peter Jeavons, Christopher Jefferson, Karen E Petrie, Barbara M Smith","year":"2006","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Condon, 1992] Anne Condon. The complexity of stochastic games. Information and Computation, 96:203-224, 1992.","title":"The complexity of stochastic games","authors":"Anne Condon","year":"1992","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Gelly and Silver, 2007] Sylvain Gelly and David Silver. Combining online and offline knowledge in UCT. In Proceedings of ICML, pages 273-280, 2007.","title":"Combining online and offline knowledge in UCT","authors":"Silver Gelly, Sylvain Gelly, David Silver","year":"2007","venue":"Proceedings of ICML","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Genesereth et al., 2005] Michael Genesereth, Nathaniel Love, and Barney Pell. General game playing: Overview of the AAAI competition. AAAI Magazine, 26(2):62-72, 2005.","title":"General game playing: Overview of the AAAI competition","authors":"Michael Genesereth, Nathaniel Love, Barney Pell","year":"2005","venue":"AAAI Magazine","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Hnich et al., 2012] Brahim Hnich, Roberto Rossi, S. Ar- magan Tarim, and Steven Prestwich. Filtering algorithms for global chance constraints. Artificial Intelligence, 189:69-94, 2012.","title":"Filtering algorithms for global chance constraints","authors":"Brahim Hnich, Roberto Rossi, S Armagan Tarim, Steven Prestwich","year":"2012","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Jégou, 1993] Philippe Jégou. Decomposition of domains based on the micro-structure of finite constraint- satisfaction problems. In Proceedings of AAAI, pages 731-736, 1993.","title":"Decomposition of domains based on the micro-structure of finite constraintsatisfaction problems","authors":"Philippe Jégou","year":"1993","venue":"Proceedings of AAAI","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Koriche et al., 2016] Frédéric Koriche, Sylvain Lagrue, Éric Piette, and Sébastien Tabary. General game playing with stochastic CSP. Constraints, 21(1):95-114, 2016.","title":"General game playing with stochastic CSP","authors":"Frédéric Koriche, Sylvain Lagrue, Éric Piette, Sébastien Tabary","year":"2016","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kuhlmann and Stone, 2007] Gregory Kuhlmann and Peter Stone. Graph-based domain mapping for transfer learning in general games. In Proceedings of ECML, pages 188-200, 2007.","title":"Graph-based domain mapping for transfer learning in general games","authors":"Stone Kuhlmann, Gregory Kuhlmann, Peter Stone","year":"2007","venue":"Proceedings of ECML","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Lanctot et al., 2013] Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald, and Mark H.M. Winands. Monte Carlo *-minimax search. In Proceedings of IJCAI, pages 580-586, 2013.","title":"Monte Carlo *-minimax search","authors":"Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald, H M Mark, Winands","year":"2013","venue":"Proceedings of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/93"},{"position":13,"raw":"[Love et al., 2008] Nathaniel Love, Timothy Hinrichs, David Haley, Eric Schkufza, and Michael Genesereth. General game playing: Game description language specification. Technical Report LG-2006-01, Stanford University, 2008.","title":"General game playing: Game description language specification","authors":"Nathaniel Love, Timothy Hinrichs, David Haley, Eric Schkufza, Michael Genesereth","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[McKay and Piperno, 2014] Brendan D. McKay and Adolfo Piperno. Practical graph isomorphism, II. Journal of Symbolic Computation, 60(0):94 -112, 2014.","title":"Practical graph isomorphism, II","authors":"Brendan D Mckay, Adolfo Piperno","year":"2014","venue":"Journal of Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Saffidine, 2014] Abdallah Saffidine. The game description language is Turing complete. IEEE Transactions on Com- putational Intelligence and AI in Games, 6(4):320-324, 2014. [Schiffel and Thielscher, 2014] Stephan Schiffel and Michael Thielscher. Representing and reasoning about the rules of general games with imperfect information. Jour- nal of Artificial Intelligence Research, 49:171-206, 2014.","title":"The game description language is Turing complete","authors":"Abdallah Saffidine","year":"2014","venue":"IEEE Transactions on Computational Intelligence and AI in Games","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Schiffel, 2010] Stephan Schiffel. Symmetry detection in general game playing. In Proceedings of AAAI, 2010.","title":"Symmetry detection in general game playing","authors":"Stephan Schiffel","year":"2010","venue":"Proceedings of AAAI","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Sturtevant, 2008] Nathan R. Sturtevant. An analysis of UCT in multi-player games. International Computer Games Association Journal, 31(4):195-208, 2008.","title":"An analysis of UCT in multi-player games","authors":"Nathan R Sturtevant","year":"2008","venue":"International Computer Games Association Journal","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Tarim et al., 2006] S. Armagan Tarim, Suresh Manandhar, and Toby Walsh. Stochastic constraint programming: A scenario-based approach. Constraints, 11(1):53-80, 2006.","title":"Stochastic constraint programming: A scenario-based approach","authors":"S Armagan Tarim, Suresh Manandhar, Toby Walsh","year":"2006","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Thielscher, 2016] Michael Thielscher. GDL-III: A proposal to extend the game description language to general epis- temic games. In Proceedings of ECAI, pages 1630-1631, 2016.","title":"GDL-III: A proposal to extend the game description language to general epistemic games","authors":"Michael Thielscher","year":"2016","venue":"Proceedings of ECAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Walsh, 2002] Toby Walsh. Stochastic Constraint Program- ming. In Proceedings of ECAI, pages 111-115, 2002.","title":"Stochastic Constraint Programming","authors":"Toby Walsh","year":"2002","venue":"Proceedings of ECAI","doi":null,"url":null,"internal_url":"/proceedings/2017/751"},{"position":21,"raw":"[Zhang et al., 2015] Haifeng Zhang, Dangyi Liu, and Wenxin Li. Space-consistent game equivalence detection in General Game Playing. In Proceedings of CGW, pages 165-177, 2015.","title":"Space-consistent game equivalence detection in General Game Playing","authors":"Haifeng Zhang, Dangyi Liu, Wenxin Li","year":"2015","venue":"Proceedings of CGW","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Zobrist, 1990] Albert L. Zobrist. A new hashing method with application for game playing. International Com- puter Games Association Journal, 13(2):69-73, 1990.","title":"A new hashing method with application for game playing","authors":"Albert L Zobrist","year":"1990","venue":"International Computer Games Association Journal","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}