I've just realised that my deliberate avoidance of non-simply
authorsimon <simon@cda61777-01e9-0310-a592-d414129be87e>
Sat, 25 Aug 2007 15:32:41 +0000 (15:32 +0000)
committersimon <simon@cda61777-01e9-0310-a592-d414129be87e>
Sat, 25 Aug 2007 15:32:41 +0000 (15:32 +0000)
commit82ed478979e9e08bb639594c1312466b1514bf60
tree5f9340c9dacc416d0b5d035d5ef52ffb5a2811a7
parent213d24956e6fe87462164c79fbcca6ed3e8c82a4
I've just realised that my deliberate avoidance of non-simply
connected polyominoes actually causes a loss of generality for
sufficiently large k. I hadn't previously noticed, because you need
k to be (I think) at least 23 and none of my potential applications
require anything nearly that large. Add some discussion of this.

git-svn-id: svn://svn.tartarus.org/sgt/puzzles@7701 cda61777-01e9-0310-a592-d414129be87e
unfinished/divvy.c