Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3390/a5020176 | ALGORITHMS |
Keywords | Field | DocType |
link puzzles, Slitherlink, Numberlink, solvers, instance generations | Data structure,Family of sets,Mathematical optimization,Set operations,Binary decision diagram,Artificial intelligence,Machine learning,Mathematics,Grid | Journal |
Volume | Issue | ISSN |
5 | 2 | 1999-4893 |
Citations | PageRank | References |
11 | 0.67 | 2 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryo Yoshinaka | 1 | 172 | 26.19 |
| Toshiki Saitoh | 2 | 87 | 14.95 |
| Jun Kawahara | 3 | 11 | 0.67 |
| Koji Tsuruma | 4 | 14 | 1.43 |
| Hiroaki Iwashita | 5 | 89 | 9.62 |
| Shin-ichi Minato | 6 | 725 | 84.72 |