Ludii and XCSP: Playing and Solving Logic Puzzles

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

*Corresponding author for this work

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

91 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)
PublisherIEEE
Pages630-633
Number of pages4
ISBN (Print)9781728118840
DOIs
Publication statusPublished - 23 Aug 2019
EventIEEE Conference on Games (IEEE COG) - London, United Kingdom
Duration: 20 Aug 201923 Aug 2019
https://ieee-cog.org/2019/

Publication series

SeriesIEEE Conference on Computational Intelligence and Games
ISSN2325-4270

Conference

ConferenceIEEE Conference on Games (IEEE COG)
Country/TerritoryUnited Kingdom
CityLondon
Period20/08/1923/08/19
Internet address

Keywords

  • Knowledge Representation
  • Constraint Programming
  • General Game AI

Cite this