Slinker is an attempt to capture the best way to generate slitherlink-type puzzles.
(Slitherlink is probably a trademark of Nikoli who invented the puzzle, so go to them if you want to buy genuine quality puzzles.)
The current version of Slinker is 0.1. The following downloads are available:
- Windows executable (417KB)
- Linux executable (112KB)
- source code (59KB) - for all popular platforms, see the README.txt for build requirements and instructions.
Slinker works on Mac too: MacBuild
Changes since earlier revisions: ChangeList
Slinker 0.1 under Linux
- create and solve puzzles of different difficulties using a set of rules
- verify that puzzles have a unique solution
- decide whether a puzzle can be directly solved with a given ruleset.
- can offer useful hints for when you get stuck
- import/export puzzles as a Loopy string
- compute more rules, if
SlinkerGrid::FindNewRules()makes sense to you
- Undo/redo, fix position.
- Puzzle creation should be faster - can we derive 'number removal' rules that tell us which numbers can be removed for a given local situation, given a set of solving rules?
- Puzzle solving should be faster - solving a 40x30 takes a long time, even with a 4-element ruleset.
- Puzzles should make more use of the harder rules - rather than removing numbers at random, can we remove those that leave the puzzle only solvable using more complex rules?
- Export/import as full Loopy format.
- Need to add option to make a puzzle that would require highlander rules, and also make a list of highlander rules (how?).
- May want to make 'special situation' puzzles - e.g. those involving only '2's, or those with certain areas empty. How to allow the user to do this? Or provide the programmer with tools to do this?
- Analysis of puzzle difficulty - max/average level of rules required to solve, need for highlander, etc.? Ideally we'd like to be able to rate every puzzle as scientifically as possible, and seek consensus on the method.