Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03301117
Contributor : Fabien Delorme <>
Submitted on : Tuesday, July 27, 2021 - 12:57:48 PM
Last modification on : Thursday, September 9, 2021 - 3:10:29 PM

Identifiers

  • HAL Id : hal-03301117, version 1

Collections

Citation

Cédric Piette, Eric Piette, Matthew Stephenson, Dennis Soemers, Cameron Browne. Ludii and XCSP: Playing and Solving Logic Puzzles. IEEE Conferences on Games (COG'19), 2019, Londres (UK), Unknown Region. ⟨hal-03301117⟩

Share

Metrics

Record views

9