Ludii and XCSP: Playing and Solving Logic Puzzles - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Ludii and XCSP: Playing and Solving Logic Puzzles

(1) , , , ,
1
Cédric Piette
Eric Piette
  • Function : Author
Matthew Stephenson
  • Function : Author
Dennis Soemers
  • Function : Author
Cameron Browne
  • Function : 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.
Not file

Dates and versions

hal-03301117 , version 1 (27-07-2021)

Identifiers

  • HAL Id : hal-03301117 , version 1

Cite

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⟩
10 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More