Minimal Puzzles

Everything about Sudoku that doesn't fit in one of the other sections
I redid the calculations without the potential hole and found that this pattern is not minimal.
Code: Select all
`+-------+-------+-------+| . . x | x x x | x . . || . x x | . . . | x x . || x x . | . . . | . x x |+-------+-------+-------+| x . . | . . . | . . . || x . . | . . . | . . . || x . . | . . . | . . . |+-------+-------+-------+| . x . | . . . | . . . || . x x | . . . | . . . || . . . | . . . | . . . |+-------+-------+-------+ `

The hole is that I added a few clues (2-4) at a time and then I removed duplicates, but a sudoku morphism that identify 2 isomorphic subpuzzles of that pattern may not be a pattern morphism of the full pattern, and so we would not count some valid puzzles afterwards. In other words, if 2 subpuzzles are isomorphic but the morphism is not a pattern morphism of the full pattern, and we remove the second of them, then we will not be counting some puzzles (offsping of the second one) that could be valid (on the premise that they are isomorphic to a offsping puzzle of the first one, and that could be false).
Mauricio

Posts: 1174
Joined: 22 March 2006

While Mauricio is looking for some new non minimal patterns, I'd like to raise an open question :

Knowing that a puzzle is minimal, is there any specific techniques to solve it ?

btw, a while ago, I posted this non minimal puzzle :
I wrote:Here is one non minimal puzzle.
x are clues.

Any solvers ?
Code: Select all
` x x 6 | . . . | . . . . x . | . . . | 4 . . . . . | . . . | . . x-------+-------+------- . . . | x . . | . . . . . . | x . x | . . . . . . | 9 . . | . x 1-------+-------+------- x . . | . . . | 8 . . 5 . . | . x . | . . . . . . | . 2 . | . 3 .`

JPF
JPF
2017 Supporter

Posts: 3781
Joined: 06 December 2005
Location: Paris, France

JPF wrote:Here is one non minimal puzzle.
x are clues.

Any solvers ?
Code: Select all
` x x 6 | . . . | . . . . x . | . . . | 4 . . . . . | . . . | . . x-------+-------+------- . . . | x . . | . . . . . . | x . x | . . . . . . | 9 . . | . x 1-------+-------+------- x . . | . . . | 8 . . 5 . . | . x . | . . . . . . | . 2 . | . 3 .`

I just spent 10 valuable minutes of my life solving that puzzle, only to find out that Ocean had found the same solution 18 months ago...

JPF wrote:Knowing that a puzzle is minimal, is there any specific techniques to solve it ?

This problem is a lot harder than the non minimal puzzle above. I thought about this problem a long time ago when Bill Smythe first proposed it here. If I recall correctly, back then I came to the conclusion that such a technique is impossible...

RW
RW
2010 Supporter

Posts: 1000
Joined: 16 March 2006

RW wrote:I just spent 10 valuable minutes of my life solving that puzzle, only to find out that Ocean had found the same solution 18 months ago...

Sorry, I should have produced an other puzzle.
I gave it (again) just as an extreme example in this thread of a way to "solve" a puzzle when information on minimality is known.
What would be the conclusions if this information is not given ?

RW wrote:
JPF wrote:Knowing that a puzzle is minimal, is there any specific techniques to solve it ?

This problem is a lot harder than the non minimal puzzle above. I thought about this problem a long time ago when Bill Smythe first proposed it here. If I recall correctly, back then I came to the conclusion that such a technique is impossible...

JPF
JPF
2017 Supporter

Posts: 3781
Joined: 06 December 2005
Location: Paris, France

JPF wrote:
RW wrote:If I recall correctly, back then I came to the conclusion that such a technique is impossible...

JPF

What could such a technique say? Eliminate a candidate? If that is the case, I can't see how adding a candidate and some reasoning would lead us to the conclusion that the puzzle without the added candidate is not minimal, don't you think?
Mauricio

Posts: 1174
Joined: 22 March 2006

Mauricio wrote:What could such a technique say? Eliminate a candidate? If that is the case, I can't see how adding a candidate and some reasoning would lead us to the conclusion that the puzzle without the added candidate is not minimal, don't you think?

I share your scepticism on such a possible technique.

In addition, if P is the initial (minimal) puzzle, such technique would have to be applied just at the beginning :
as soon as the first cell c is known, P + c is not minimal anymore.

JPF
JPF
2017 Supporter

Posts: 3781
Joined: 06 December 2005
Location: Paris, France

Previous