Ludii and XCSP: Playing and Solving Logic Puzzles

Cédric Piette; Eric Piette; Matthew Stephenson; Dennis Soemers; Cameron Browne

doi:10.1109/CIG.2019.8848086

Ludii and XCSP: Playing and Solving Logic Puzzles

Cédric Piette^*, Eric Piette, Matthew Stephenson, Dennis Soemers, Cameron Browne

^*Corresponding author for this work

Advanced Computing Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

157 Downloads (Pure)

Abstract

Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as Sudoku, but also enjoy the ability to check their solution easily once it’s done. For this reason, using constraint programming is naturally suited to solve them. In this paper, we focus on logic puzzles described in the Ludii general game system and we propose using the XCSP formalism in order to solve them with any CSP solver.

Original language	English
Title of host publication	IEEE Conference on Games
Subtitle of host publication	(CoG'19)
Publisher	IEEE
Pages	630-633
Number of pages	4
ISBN (Print)	9781728118840
DOIs	https://doi.org/10.1109/CIG.2019.8848086
Publication status	Published - 23 Aug 2019
Event	IEEE Conference on Games (IEEE COG) - London, United Kingdom Duration: 20 Aug 2019 → 23 Aug 2019 https://ieee-cog.org/2019/

Publication series

Series	IEEE Conference on Computational Intelligence and Games
ISSN	2325-4270

Conference

Conference	IEEE Conference on Games (IEEE COG)
Country/Territory	United Kingdom
City	London
Period	20/08/19 → 23/08/19
Internet address	https://ieee-cog.org/2019/

Keywords

Knowledge Representation
Constraint Programming
General Game AI

Access to Document

10.1109/CIG.2019.8848086

Full TextFinal published version, 187 KBLicence: Taverne
cog19-4

Cite this

@inproceedings{d5af7209477946a2a7dc2b8dc8b144c5,

title = "Ludii and XCSP: Playing and Solving Logic Puzzles",

abstract = "Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as Sudoku, but also enjoy the ability to check their solution easily once it{\textquoteright}s done. For this reason, using constraint programming is naturally suited to solve them. In this paper, we focus on logic puzzles described in the Ludii general game system and we propose using the XCSP formalism in order to solve them with any CSP solver.",

keywords = "Knowledge Representation, Constraint Programming, General Game AI",

author = "C{\'e}dric Piette and Eric Piette and Matthew Stephenson and Dennis Soemers and Cameron Browne",

note = "Funding Information: This research is part of the European Research Council-funded Digital Ludeme Project (ERC Consolidator Grant #771292) run by Cameron Browne at Maastricht University{\textquoteright}s Department of Data Science and Knowledge Engineering. Funding Information: This research is part of the European Research Councilfunded Digital Ludeme Project (ERC Consolidator Grant #771292) run by Cameron Browne at Maastricht University's Department of Data Science and Knowledge Engineering. Publisher Copyright: {\textcopyright} 2019 IEEE.; IEEE Conference on Games (IEEE COG) ; Conference date: 20-08-2019 Through 23-08-2019",

year = "2019",

month = aug,

day = "23",

doi = "10.1109/CIG.2019.8848086",

language = "English",

isbn = "9781728118840",

series = "IEEE Conference on Computational Intelligence and Games",

publisher = "IEEE",

pages = "630--633",

booktitle = "IEEE Conference on Games",

address = "United States",

url = "https://ieee-cog.org/2019/",

}

TY - GEN

T1 - Ludii and XCSP: Playing and Solving Logic Puzzles

AU - Piette, Cédric

AU - Piette, Eric

AU - Stephenson, Matthew

AU - Soemers, Dennis

AU - Browne, Cameron

N1 - Funding Information: This research is part of the European Research Council-funded Digital Ludeme Project (ERC Consolidator Grant #771292) run by Cameron Browne at Maastricht University’s Department of Data Science and Knowledge Engineering. Funding Information: This research is part of the European Research Councilfunded Digital Ludeme Project (ERC Consolidator Grant #771292) run by Cameron Browne at Maastricht University's Department of Data Science and Knowledge Engineering. Publisher Copyright: © 2019 IEEE.

PY - 2019/8/23

Y1 - 2019/8/23

N2 - Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as Sudoku, but also enjoy the ability to check their solution easily once it’s done. For this reason, using constraint programming is naturally suited to solve them. In this paper, we focus on logic puzzles described in the Ludii general game system and we propose using the XCSP formalism in order to solve them with any CSP solver.

AB - Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as Sudoku, but also enjoy the ability to check their solution easily once it’s done. For this reason, using constraint programming is naturally suited to solve them. In this paper, we focus on logic puzzles described in the Ludii general game system and we propose using the XCSP formalism in order to solve them with any CSP solver.

KW - Knowledge Representation

KW - Constraint Programming

KW - General Game AI

U2 - 10.1109/CIG.2019.8848086

DO - 10.1109/CIG.2019.8848086

M3 - Conference article in proceeding

SN - 9781728118840

T3 - IEEE Conference on Computational Intelligence and Games

SP - 630

EP - 633

BT - IEEE Conference on Games

PB - IEEE

T2 - IEEE Conference on Games (IEEE COG)

Y2 - 20 August 2019 through 23 August 2019

ER -