A new "Unique Rectangle" Variant??
Posted: Thu Mar 30, 2006 11:57 pm
Ruud,
What do you think of this? It is a message I posted on Daily Sudoku. Although I do not use your SudoCue solver, and so do not know how you would solve it, no one has claimed that they can solve this puzzle with the logic given below
Best wishes,
Keith
===========================.
There is a method to solve this puzzle without chains:
Code:
2 5 1 |7 4 8|9 6 3
3 9 4 |6 5 2|7 18 18
6 7 8 |1 3 9|4 5 2
--------+-------+--------
5 26 267|9 8 3|12 4 17
1 8 3 |4 2 7|5 9 6
9 4 27 |5 1 6|28 3 78
--------+-------+--------
8 3 69 |2 679 4|16 17 5
4 26 5 |8 67 1|3 27 9
7 1 269|3 69 5|68 28 4
First, there is an X-wing on <9>. The corners are R7C3, R7C5, R9C3, and R9C5. This does not lead to any eliminations, but note that either R7C3 and R9C5 are <9>, or R7C5 and R9C3 are <9>.
Second, there is a possible non-unique rectangle on <69> lurking in the same squares as the X-wing. So, R7C5 and R9C3 CANNOT be <9>, for then R7C3 and R9C5 must be <6>, and there will be a non-unique rectangle.
So, R7C3 and R9C5 must be <9>.
Finally, to solve the puzzle, there is a BUG pattern which forces R4C3 = <2>.
Pretty cool, I think! I have not seen this variation of a unique rectangle described before.
Best wishes,
Keith
What do you think of this? It is a message I posted on Daily Sudoku. Although I do not use your SudoCue solver, and so do not know how you would solve it, no one has claimed that they can solve this puzzle with the logic given below
Best wishes,
Keith
===========================.
There is a method to solve this puzzle without chains:
Code:
2 5 1 |7 4 8|9 6 3
3 9 4 |6 5 2|7 18 18
6 7 8 |1 3 9|4 5 2
--------+-------+--------
5 26 267|9 8 3|12 4 17
1 8 3 |4 2 7|5 9 6
9 4 27 |5 1 6|28 3 78
--------+-------+--------
8 3 69 |2 679 4|16 17 5
4 26 5 |8 67 1|3 27 9
7 1 269|3 69 5|68 28 4
First, there is an X-wing on <9>. The corners are R7C3, R7C5, R9C3, and R9C5. This does not lead to any eliminations, but note that either R7C3 and R9C5 are <9>, or R7C5 and R9C3 are <9>.
Second, there is a possible non-unique rectangle on <69> lurking in the same squares as the X-wing. So, R7C5 and R9C3 CANNOT be <9>, for then R7C3 and R9C5 must be <6>, and there will be a non-unique rectangle.
So, R7C3 and R9C5 must be <9>.
Finally, to solve the puzzle, there is a BUG pattern which forces R4C3 = <2>.
Pretty cool, I think! I have not seen this variation of a unique rectangle described before.
Best wishes,
Keith