Ok, I see.
This is the case where the closure has only one more cell than the initial puzzle.
For the creator of this type of puzzle, I guess it's about finding the maximum SER for the placement.
JPF
yzfwsf wrote:This Sudoku variant cannot use UR or any technology that relies on unique solutions to puzzles.
m_b_metcalf wrote:... such as the backdoor 6r2c6.
Mike
yzfwsf wrote:m_b_metcalf wrote:... such as the backdoor 6r2c6.
Mike
I don’t quite understand what you want to explain, but the solution to this puzzle is r3c2=7.
m_b_metcalf wrote:I'm simply agreeing that you can't use solving techniques based on uniqueness. Backdoors rely on that, and I find two in this puzzle, the other being 8r3c9.
m_b_metcalf wrote:Backdoors rely on that (uniqueness)
denis_berthier wrote:It depends on how you define a backdoor.
In my view, it's any candidate that, when added to the givens, allows to find a solution using only Singles.
As a result, in case of non-uniqueness, different backdoors can lead to different solutions. However, I'm not sure the notion of a backdoor is very useful in this case.
m_b_metcalf wrote:denis_berthier wrote:It depends on how you define a backdoor.
In my view, it's any candidate that, when added to the givens, allows to find a solution using only Singles.
As a result, in case of non-uniqueness, different backdoors can lead to different solutions. However, I'm not sure the notion of a backdoor is very useful in this case.
On that strict definition only the second one I find is a true backdoor. But both lead to the same solution, DEFISE's number 161.
denis_berthier wrote:What is your looser definition?
m_b_metcalf wrote:denis_berthier wrote:What is your looser definition?
My program can allow other simple techniques apart from singles, but I can switch that off. M.
. . . . . 9 . . 1
. 3 . . . . . 2 .
. . 5 6 8 . . . .
. . 4 . . 8 7 . .
. . 6 . . . . . .
1 . . 4 . . . . .
. . . 7 . . 5 . .
. 4 . . . . . 6 .
2 . . . . . . . 8 Diagonal symmetry, no. of givens = 19.
.....9..1.3.....2...568......4..87....6......1..4........7..5...4.....6.2.......8
. . . . . . . 2 .
. . . . . 9 . 7 3
. . 8 . 5 . . . .
. . . 4 . . . 6 .
. . 5 . . . 4 . .
. 1 . . . 2 . . .
. . . . 8 . 3 . .
6 2 . 1 . . . . .
. 3 . . . . . . . Rotational symmetry, no. of givens = 18.
.......2......9.73..8.5.......4...6...5...4...1...2.......8.3..62.1......3.......
yzfwsf wrote: How did you make these puzzles. I use the following generation method, first find a suitable pear puzzle, and then use the traditional top-down method.