| Class Tree | |
|---|---|
| Description |
A puzzle similar to Su-Doku with an additional conditon that requires sections of the puzzle to be connected (i.e. requires reachability). Two encodings are given, one encodes reachability and grounds to about 250,000 rules for the given example. The second encoding is only just over 1000 rules and is tight but will give answer sets that are not solutions. http://www.cs.bath.ac.uk/~mjb/asp/ |
| Submitter | Martin Gebser |
| Compatible Encodings |
|
| Output Predicates |
|
| Instances 21 - 40 of 211 |
|
Expand All
Collapse All
