Finding all solutions and instances of Numberlink and Slitherlink by ZDDs (Q1736507)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7042121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding all solutions and instances of Numberlink and Slitherlink by ZDDs |
scientific article; zbMATH DE number 7042121 |
Statements
Finding all solutions and instances of Numberlink and Slitherlink by ZDDs (English)
0 references
26 March 2019
0 references
Summary: 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 structure for a family of sets provided with a rich family of set operations, by which, for example, one can easily extract a subfamily satisfying a desired property. Thanks to the nature of ZDDs, our algorithms offer a tool to assist users to design instances of those link puzzles.
0 references
link puzzles
0 references
Slitherlink
0 references
Numberlink
0 references
solvers
0 references
instance generations
0 references
0.7442544102668762
0 references
0.7278910875320435
0 references
0.6915361881256104
0 references
0.6899934411048889
0 references
0.6880817413330078
0 references
