Ludii and XCSP: Playing and Solving Logic Puzzles

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

18 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 languageEnglish
Title of host publicationIEEE Conference on Games
Subtitle of host publication(CoG'19)
Publication statusPublished - 23 Aug 2019

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’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.",
author = "C{\'e}dric Piette and Eric Piette and Matthew Stephenson and Dennis Soemers and Cameron Browne",
year = "2019",
month = "8",
day = "23",
language = "English",
booktitle = "IEEE Conference on Games",

}

Ludii and XCSP: Playing and Solving Logic Puzzles. / Piette, Cédric; Piette, Eric; Stephenson, Matthew; Soemers, Dennis; Browne, Cameron.

IEEE Conference on Games: (CoG'19). 2019.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

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

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.

M3 - Conference article in proceeding

BT - IEEE Conference on Games

ER -