Ludii and XCSP: Playing and Solving Logic Puzzles

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

35 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)
Pages630-633
Number of pages4
Publication statusPublished - 23 Aug 2019

Cite this

Piette, C., Piette, E., Stephenson, M., Soemers, D., & Browne, C. (2019). Ludii and XCSP: Playing and Solving Logic Puzzles. In IEEE Conference on Games: (CoG'19) (pp. 630-633)