Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs

Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs

Link puzzles involve finding paths or a cycle in a grid that satisfy given local and global properties. This paper proposes algorithms that enumerate solutions and instances of two link puzzles, Slitherlink and Numberlink, by zero-suppressed binary decision diagrams (ZDDs). A ZDD is a compact data s...

Full description

Bibliographic Details
Main Authors: Shin-ichi Minato, Koji Tsuruma, Hiroaki Iwashita, Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara
Format: Article
Language:English
Published: MDPI AG 2012-04-01
Series:Algorithms
Subjects:
link puzzles
Slitherlink
Numberlink
solvers
instance generations
Online Access:http://www.mdpi.com/1999-4893/5/2/176/

Internet

http://www.mdpi.com/1999-4893/5/2/176/

Similar Items