aboutsummaryrefslogtreecommitdiff
path: root/maxflow.h
diff options
context:
space:
mode:
authorSimon Tatham <anakin@pobox.com>2013-05-05 20:21:50 +0000
committerSimon Tatham <anakin@pobox.com>2013-05-05 20:21:50 +0000
commit2f7831bb1626d82baff706e507d61a820ad84df1 (patch)
treeef1e6952fd4dacfbc54b2a90d99af6eca4333880 /maxflow.h
parent16de3a8f22cf9b618372dfe2fe438b21a54f71d4 (diff)
downloadpuzzles-2f7831bb1626d82baff706e507d61a820ad84df1.zip
puzzles-2f7831bb1626d82baff706e507d61a820ad84df1.tar.gz
puzzles-2f7831bb1626d82baff706e507d61a820ad84df1.tar.bz2
puzzles-2f7831bb1626d82baff706e507d61a820ad84df1.tar.xz
New configuration option in Unruly, to enable a mode in which no two
rows are permitted to have exactly the same pattern, and likewise columns. (A row and a column can match, though.) This rule is sometimes used, but not always; http://www.binarypuzzle.com/ in particular has it (as a user just pointed out). Since the filled-grid-generation stage of Unruly is implemented by repeatedly choosing a square and then calling the solver to fill in all its consequences, simply adding a solver mode conditional on this flag is sufficient to do the whole of the interesting part of the job. [originally from svn r9837]
Diffstat (limited to 'maxflow.h')
0 files changed, 0 insertions, 0 deletions