2 Ben Lynn <benlynn@gmail.com>
4 These programs use ZDDs (zero-suppressed binary decision diagrams) to solve
5 logic puzzles. See Knuth, "The Art of Computer Programming", Volume 4,
6 Fascicle 1, which I partly summarized:
8 http://crypto.stanford.edu/pbc/notes/zdd/
12 |===========================================
13 | Puzzle | Sample Input | Source
14 |===========================================
15 | Dominosa | dominosa.txt | dom.c
16 | Fillomino | fillomino.txt | fill.c
17 | Lights Out | light.txt | light.c
18 | Slither Link | slither.txt | loop.c
19 | Nonogram | nonogram.txt | nono.c
20 |===========================================
22 All programs read a puzzle from standard input then print the solution on
25 The file spi.txt is a Slither Link puzzle I used loop.c to construct. Try
26 solving it by hand first.
28 Standard Sudokus are too big to be efficiently solvable by ZDDs. I found
29 out the hard way: see sud.c.
31 I began a Nurikabe solver but I have since been distracted.