Solving Challenging Grid Puzzles with Answer Set Programming. Cayli, M., Karatop, A. G., Kavlak, E., Kaynar, H., Ture, F., & Erdem, E. In Proc. of ASP, pages 175-190, 2007.
Solving Challenging Grid Puzzles with Answer Set Programming [pdf]N  abstract   bibtex   
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.

Downloads: 0