| Class Tree | |
|---|---|
| Description |
A program the gives solution to a classic chess problem, that of visiting every square of a chess board once and only once using a knight. http://www.cs.bath.ac.uk/~mjb/asp/ |
| Submitter | Martin Gebser |
| Compatible Encodings | |
| Output Predicates |
|
| Instances 121 - 140 of 165 |
|
Expand All
Collapse All
