Solving challenging grid puzzles with answer set programming
Merve Çaylı, Ayşe Gül Karatop, Ahmet Emrah Kavlak, Hakan Kaynar, Ferhan Türe, Esra Erdem · Sabanci University · 2007
Abstract. 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. 1