diff options
| author | Simon Tatham <anakin@pobox.com> | 2005-04-25 14:17:14 +0000 |
|---|---|---|
| committer | Simon Tatham <anakin@pobox.com> | 2005-04-25 14:17:14 +0000 |
| commit | 0fffbf32dbe92d370df36745a165f4065629e5fb (patch) | |
| tree | 326efcccb16984fd99f65ac3ea62bd4a7aa43e57 | |
| parent | a163926ed5b74c23211ccd4b3f3e58401d8f720b (diff) | |
| download | puzzles-0fffbf32dbe92d370df36745a165f4065629e5fb.zip puzzles-0fffbf32dbe92d370df36745a165f4065629e5fb.tar.gz puzzles-0fffbf32dbe92d370df36745a165f4065629e5fb.tar.bz2 puzzles-0fffbf32dbe92d370df36745a165f4065629e5fb.tar.xz | |
Oops; _actually_ add the reasoning mode I mentioned in the last
checkin.
[originally from svn r5671]
| -rw-r--r-- | solo.c | 6 |
1 files changed, 6 insertions, 0 deletions
@@ -567,6 +567,12 @@ static int rsolve(int c, int r, digit *grid, random_state *rs, int max) * subset: the numbers 1, 2 and 3 _must_ be in those three * squares in some permutation, and hence we can deduce none of * them can be in the fourth or fifth squares.) + * + * - Setwise positional elimination: if there is a subset of the + * unplaced numbers within a domain such that the union of all + * their possible positions has the same size as the subset + * itself, then all other numbers can be ruled out for those + * positions. */ /* |