~mdw / sgt / puzzles / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 5ad01ca) | patch
Net hangs if you ask it for a 2xn or nx2 wrapping puzzle with a
authorsimon <simon@cda61777-01e9-0310-a592-d414129be87e>
Mon, 23 May 2005 11:03:52 +0000 (11:03 +0000)
committersimon <simon@cda61777-01e9-0310-a592-d414129be87e>
Mon, 23 May 2005 11:03:52 +0000 (11:03 +0000)
commite7c352f521d57f75ee11595dcc91fccecf96a738
tree91d4cb571267fd369779cd446dfc59f81be283a4tree | snapshot (tar.gz zip)
parent5ad01ca45dbd80c55bdaf2a716fd5587490d4822commit | diff
Net hangs if you ask it for a 2xn or nx2 wrapping puzzle with a
unique solution. This, it turns out, is because there is literally
no such thing. Protective constraint added to validate_params(),
with a proof in a comment alongside.

If you really want a 2xn or nx2 wrapping puzzle, you can still have
one if you turn uniqueness off.

git-svn-id: svn://svn.tartarus.org/sgt/puzzles@5835 cda61777-01e9-0310-a592-d414129be87e
net.c diff | blob | blame | history
Simon Tatham's portable puzzles collection; import of svn://svn.tartarus.org/sgt/puzzles