Solving Challenging Grid Puzzles with Answer Set Programming

Back

Solving Challenging Grid Puzzles
with Answer Set Programming

Merve Cayli, Ayse Gul Karatop, Emrah Kavlak, Hakan Kaynar, Ferhan Ture, and Esra Erdem
Faculty of Engineering and Natural Sciences
Sabanci University, Istanbul 34956, Turkey

We study four challenging grid puzzles, Nurikabe, Heyawake, Masyu, Bag Puzzle, interesting for Answer Set Programming (ASP) from the viewpoints of representation and computation: they show expressivity of ASP, they are good examples of a representation methodology, and they form a useful suite of benchmarks for evaluating/improving computational methods for nontight programs.