Ludii and XCSP: Playing and Solving Logic Puzzles

Piette, Cedric;Piette, Eric;Stephenson, Matthew;Soemers, Dennis;Browne, Cameron
(2019) 2019 IEEE Conference on Games (CoG) — Location: London, United Kingdom (20.August.2019)

Files

cog19-4.pdf
  • Open Access
  • Adobe PDF
  • 180.64 KB

Details

Authors
  • Piette, Cedric
    Author
  • Piette, EricUCLouvain
    Author
  • Stephenson, Matthew
    Author
  • Soemers, Dennis
    Author
  • Browne, Cameron
    Author
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.
Affiliations

Citations

Piette, C., Piette, E., Stephenson, M., Soemers, D., & Browne, C. (2019). Ludii and XCSP: Playing and Solving Logic Puzzles. 2019 IEEE Conference on Games (CoG). Published. 2019 IEEE Conference on Games (CoG), London, United Kingdom. https://doi.org/10.1109/cig.2019.8848086