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...
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: | |
Online Access: | http://www.mdpi.com/1999-4893/5/2/176/ |
Similar Items
-
A Jigsaw Puzzle Solver-Based Attack on Image Encryption Using Vision Transformer for Privacy-Preserving DNNs
by: Tatsuya Chuman, et al.
Published: (2023-05-01) -
DIM: long-tailed object detection and instance segmentation via dynamic instance memory
by: Zhao-Min Chen, et al.
Published: (2023-01-01) -
Instance Sequence Queries for Video Instance Segmentation with Transformers
by: Zhujun Xu, et al.
Published: (2021-06-01) -
Recognition improvement through the optimisation of learning instances
by: Hao Wu, et al.
Published: (2015-06-01) -
Appeal Court as the Court of the First Instance
by: Morozova A. S.
Published: (2015-04-01)