aboutsummaryrefslogtreecommitdiff
path: root/pattern.R
diff options
context:
space:
mode:
authorSimon Tatham <anakin@pobox.com>2007-02-22 18:09:51 +0000
committerSimon Tatham <anakin@pobox.com>2007-02-22 18:09:51 +0000
commit9d9e02f1d5d5de569ec727ed98834c5f2426c515 (patch)
treed27834b684519a57a9abddaf138e10906c8f6d5a /pattern.R
parent86ee29ac4839870139d73b10be739fb6fcb93ef5 (diff)
downloadpuzzles-9d9e02f1d5d5de569ec727ed98834c5f2426c515.zip
puzzles-9d9e02f1d5d5de569ec727ed98834c5f2426c515.tar.gz
puzzles-9d9e02f1d5d5de569ec727ed98834c5f2426c515.tar.bz2
puzzles-9d9e02f1d5d5de569ec727ed98834c5f2426c515.tar.xz
We may reluctantly permit the returning of a too-easy puzzle if an
adequately hard one couldn't be found, but we must never return a puzzle harder than the user asked for, and we _certainly_ mustn't return one that we aren't even sure has a unique solution. However, when I attempted to implement this rule, it turned out that an attempt to generate a 15x15 Easy puzzle didn't terminate before I got bored and killed it. I'm therefore retiring the Easy difficulty level on the grounds that it's not a wide enough band to be useful. I've renamed Hard to Normal, and (while I was there) renamed Recursive to Unreasonable in line with my normal practice. [originally from svn r7309]
Diffstat (limited to 'pattern.R')
0 files changed, 0 insertions, 0 deletions