TY - GEN
T1 - Ludii and XCSP
T2 - 2019 IEEE Conference on Games, CoG 2019
AU - Piette, Cedric
AU - Piette, Eric
AU - Stephenson, Matthew
AU - Soemers, Dennis J.N.J.
AU - Browne, Cameron
PY - 2019/8
Y1 - 2019/8
N2 - 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.
AB - 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.
KW - Constraint Programming
KW - General Game AI.
KW - Knowledge Representation
UR - http://www.scopus.com/inward/record.url?scp=85073113824&partnerID=8YFLogxK
U2 - 10.1109/CIG.2019.8848086
DO - 10.1109/CIG.2019.8848086
M3 - Conference contribution
AN - SCOPUS:85073113824
SN - 9781728118857
T3 - IEEE Conference on Computatonal Intelligence and Games, CIG
BT - IEEE Conference on Games 2019, CoG 2019
PB - Institute of Electrical and Electronics Engineers
Y2 - 20 August 2019 through 23 August 2019
ER -