chiark / gitweb /
~ian / sgt-puzzles.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: c746f6d) | patch
I've just realised that my deliberate avoidance of non-simply
authorSimon Tatham <anakin@pobox.com>
Sat, 25 Aug 2007 15:32:41 +0000 (15:32 +0000)
committerSimon Tatham <anakin@pobox.com>
Sat, 25 Aug 2007 15:32:41 +0000 (15:32 +0000)
commitcb0901306de9b1698323823f0180f98c6bac7789
tree5f9340c9dacc416d0b5d035d5ef52ffb5a2811a7tree | snapshot
parentc746f6d0e3996092de94ecbf72d039632594f7e0commit | diff
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.

[originally from svn r7701]
unfinished/divvy.c diff | blob | history
Unnamed repository; edit this file 'description' to name the repository.