Minimal Puzzles

Everything about Sudoku that doesn't fit in one of the other sections

Postby Mauricio » Sat Oct 13, 2007 8:23 pm

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: 1176
Joined: 22 March 2006

Postby JPF » Thu Nov 08, 2007 12:18 am

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: 6153
Joined: 06 December 2005
Location: Paris, France

Postby RW » Thu Nov 08, 2007 4:14 pm

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: 1010
Joined: 16 March 2006

Postby JPF » Fri Nov 09, 2007 12:40 am

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...
Could you elaborate please ?

JPF
JPF
2017 Supporter
 
Posts: 6153
Joined: 06 December 2005
Location: Paris, France

Postby Mauricio » Thu Nov 22, 2007 10:23 am

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

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: 1176
Joined: 22 March 2006

Postby JPF » Fri Nov 23, 2007 12:46 am

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: 6153
Joined: 06 December 2005
Location: Paris, France

Re: Minimal Puzzles

Postby Serg » Thu Oct 10, 2024 4:01 pm

Hi, people!
I've done exhaustive search for one-band nonminimal patterns (defined and published in this thread - see Non minimal patterns definition). I've found 22 patterns. Here they are:
Code: Select all
         N1                      N2                      N3

+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . x|     |. . .|x x x|x x x|
|x x x|x x x|x x x|     |x x x|x x x|. . .|     |. . .|x x x|x x x|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

         N4                      N5                      N6

+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|. . x|     |. . .|. . .|x x x|     |. . .|. . .|x x x|
|. . .|x x x|. . .|     |. . .|. . .|x x x|     |. . .|x x x|. . .|
|. . .|x x x|. . .|     |. . .|. . .|x x x|     |x x x|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

         N7                      N8                      N9

+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|x x x|     |. . .|. . .|x x x|     |. . .|. . .|x x x|
|. . x|. x x|. . .|     |. . x|. x x|. . .|     |. . x|. x x|. . x|
|. x x|x x x|. . .|     |x x .|x x x|. . .|     |x x x|. x x|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N10                     N11                     N12

+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|x x x|     |. . .|. . .|x x x|     |. . .|. . .|x x x|
|. . x|. x x|. . x|     |. . x|x x x|. . .|     |. . x|x x x|. . .|
|x x x|x . x|. . .|     |. x x|. x x|. . x|     |x x .|. x x|. . x|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N13                     N14                     N15

+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . x|. x x|     |. . .|. . x|. x x|     |. . .|. . x|. x x|
|. . .|x x x|. x x|     |. . .|x x x|. x x|     |. . .|x x x|x . x|
|x x x|. . .|. . x|     |x x x|. . .|x . .|     |x x x|. . .|. . x|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N16                     N17                     N18

+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . x|. x x|     |. . .|. . x|. x x|     |. . .|. . x|x x x|
|. . .|x x x|x . x|     |. . .|x x x|x . x|     |. . .|. x x|. x x|
|x x x|. . .|. x .|     |x x x|. . .|x . .|     |x x x|. . x|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N19                     N20                     N21

+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . x|x x x|     |. . .|. . x|x x x|     |. . .|. . x|x x x|
|. . .|. x x|. x x|     |. . .|. x x|. x x|     |. . .|x x .|. x x|
|x x x|. x .|. . .|     |x x x|x . .|. . .|     |x x x|. . x|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N22

+-----+-----+-----+
|. . .|. . x|x x x|
|. . .|x x .|. x x|
|x x x|. x .|. . .|
+-----+-----+-----+

Some of them are well known, but there are several new ones.
  • N1 - trivial.
  • N2 - published by ravel.
  • N3 - published by Mauricio.
  • N4 - published by Mauricio.
  • N5 - trivial.
Remaining patterns are new. (Mauricio published pattern similar to N7, but with 1 extra clue.)

Serg

[Edited. I added link to nonminimal patterns definition in the JPF's post.]
Last edited by Serg on Thu Oct 10, 2024 7:53 pm, edited 1 time in total.
Serg
2018 Supporter
 
Posts: 930
Joined: 01 June 2010
Location: Russia

Re: Minimal Puzzles

Postby champagne » Thu Oct 10, 2024 6:42 pm

Serg wrote:Hi, people!
I've done exhaustive search for one-band nonminimal patterns (defined and published in this thread).
Serg

Hi serg
I tried to understand what you did, but I confess that I am lazy.
instead of (defined and published in this thread) a link to the corresponding post could help
champagne
2017 Supporter
 
Posts: 7953
Joined: 02 August 2007
Location: France Brittany

Re: Minimal Puzzles

Postby coloin » Fri Oct 11, 2024 11:57 am

Serg wrote:Hi, people!
I've done exhaustive search for one-band nonminimal patterns


N1 is an invalid pattern - cant have any puzzles, but i guess the point is that you cant have 9 clues in a row...

If the other patterns all have valid puzzles but these cannot be minimal ... its a nice list !

At a stroke... with N6 we could compile a big list of complete puzzle 18C patterns which cant have minimal puzzles !!!

Maybe patterns from band1plusrow4 [4 rows] with no non-minimal puzzles would be interesting too
Code: Select all
+---+---+---+
|...|...|...|
|...|...|..4|
|..3|456|789|
+---+---+---+
|1..|...|...|
Example [ but not verified]
coloin
 
Posts: 2717
Joined: 05 May 2005
Location: Devon

Re: Minimal Puzzles

Postby Serg » Fri Oct 11, 2024 6:34 pm

Hi, coloin!
coloin wrote:N1 is an invalid pattern - cant have any puzzles, but i guess the point is that you cant have 9 clues in a row...

You are right. Pattern N1 (9 clues in a row) means that any minimal puzzle cannot contain 9 clues in a row. If you are searching for 9x9 Sudoku patterns, potentially producing minimal puzzles or even patterns, producing minimal puzzles only (those patterns are called minimal valid), you can exclude from search space patterns, containing non-minimal patterns as subset. This rule applies regardless of whether pattern has valid puzzles or no. So, this is a filter assisting in searching for minimal puzzles/patterns. JPF showed it in the thread Homework exercise.

I have a proof of pattern N6 non-minimality.
Let's consider diagonally placed minirows of any Sudoku solution grid. The are 2 cases only of digits placement:
Code: Select all
       Case 1                  Case 2

+-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|a b c|     |. . .|. . .|a b e|
|. . .|a b c|. . .|     |. . .|a b d|. . .|
|a b c|. . .|. . .|     |a b c|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+

(Letters denote some digits, those digits can be really permuted within each minirow.) Any pair of those diagonally placed minirows contains at least 2 digits in common. Let's analyze some puzzle, having 9 clues in diagonally placed minirows, for minimality. One should first determine 2 common digits ("a" and "b") of minirows r3c123 and r2c456. Now we know that minirow r1c789 must contain digits "a" and "b". So, we can safely remove digit "a" or digit "b" from r1c789 minirow. Analyzed puzzle isn't minimal. (This is not full proof, only 2 cases from 4 are considered, as Blue pointed in the next post.)

I've just done exhausteve search for "corner" non-minimal patterns (having clues in B124 area only). Surprisingly, the only one such pattern does exist. It was found by marek stefanic (see his post in the thread Homework exercise). Here it is:
Code: Select all
+-----+-----+-----+
|x x x|x . x|. . .|
|. . .|. . .|. . .|
|x x x|x . x|. . .|
+-----+-----+-----+
|. . .|x . x|. . .|
|. . .|x . x|. . .|
|. . .|x . x|. . .|
+-----+-----+-----+
|. . .|. . .|. . .|
|. . .|. . .|. . .|
|. . .|. . .|. . .|
+-----+-----+-----+

Serg

[Edited. The proof posted isn't full, see the next post of Blue.]
Last edited by Serg on Fri Oct 11, 2024 11:00 pm, edited 1 time in total.
Serg
2018 Supporter
 
Posts: 930
Joined: 01 June 2010
Location: Russia

Re: Minimal Puzzles

Postby blue » Fri Oct 11, 2024 8:06 pm

Hi Serg,

Serg wrote:I have a proof of pattern N6 non-minimality.
Let's consider diagonally placed minirows of any Sudoku solution grid. The are 2 cases only of digits placement:
Code: Select all
       Case 1                  Case 2

+-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|a b c|     |. . .|. . .|a b e|
|. . .|a b c|. . .|     |. . .|a b d|. . .|
|a b c|. . .|. . .|     |a b c|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+

(Letters denote some digits, those digits can be really permuted within each minirow.) Any pair of those diagonally placed minirows contains at least 2 digits in common. Let's analyze some puzzle, having 9 clues in diagonally placed minirows, for minimality. One should first determine 2 common digits ("a" and "b") of minirows r3c123 and r2c456. Now we know that minirow r1c789 must contain digits "a" and "b". So, we can safely remove digit "a" or digit "b" from r1c789 minirow. Analyzed puzzle isn't minimal.

Two cases are missing: what you would see in the clue cells, if you completed the bands and swapped rows 1 & 2.

Code: Select all
       Case 1                  Case 2

+-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|a b c|     |. . .|. . .|a b e|
|. . .|a b c|. . .|     |. . .|a b d|. . .|
|a b c|. . .|. . .|     |a b c|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+

-> (complete bands)

+-----+-----+-----+     +-----+-----+-----+
|g h i|d e f|a b c|     |h i d|f g c|a b e|
|d e f|a b c|g h i|     |f g e|a b d|h i c|
|a b c|g h i|d e f|     |a b c|h i e|f g d|
+-----+-----+-----+     +-----+-----+-----+

-> (swap rows)

+-----+-----+-----+     +-----+-----+-----+
|d e f|a b c|g h i|     |f g e|a b d|h i c|
|g h i|d e f|a b c|     |h i d|f g c|a b e|
|a b c|g h i|d e f|     |a b c|h i e|f g d|
+-----+-----+-----+     +-----+-----+-----+

-> (mask clues)

       Case 3                  Case 4

+-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|g h i|     |. . .|. . .|h i c|
|. . .|d e f|. . .|     |. . .|f g c|. . .|
|a b c|. . .|. . .|     |a b c|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+

In case 3, each clue is redundant.
In case 4, each 'c' is redundant.
blue
 
Posts: 1121
Joined: 11 March 2013

Re: Minimal Puzzles

Postby Serg » Sat Oct 12, 2024 5:05 pm

Hi, Blue!
You are rignt - my proof of N6 pattern's non-minimality was not full. It should be extended by "case 3" and "case 4" to be complete.

Serg
Serg
2018 Supporter
 
Posts: 930
Joined: 01 June 2010
Location: Russia

Re: Minimal Puzzles

Postby JPF » Sun Nov 22, 2026 6:34 pm

Following Serg’s exhaustive search for one-band non-minimal patterns (N1–N22, Oct 2024), I looked for all non-minimal patterns up to 13 clues.

I call a pattern a base if it is non-minimal (no minimal puzzle contains it) while each of its sub-patterns is contained in some minimal puzzle. A pattern is non-minimal if and only if it contains a base.

Results for all ED patterns with up to 13 clues

Code: Select all
clues     ED patterns   non-minimal   bases
  6             3,074             0   -
  7            16,847             2   N2, N4
  8            92,393            20   -
  9           489,448           167   N1, N5, N6, N23
 10         2,499,689         1,222   -
 11        12,199,113         8,570   N7, N8
 12        56,737,622        56,830   N3, N9-N22, N24
 13       250,632,745       355,675   N25-N38

So there are exactly 38 bases with at most 13 clues: Serg’s 22 one-band patterns plus 16 that do not fit in a band.

N23 is Mauricio’s row of 8 + 1 clue (2007).
N24 (12 clues) is of the “band1plusrow4” type that coloin suggested in Oct 2024. His own example has minimal puzzles, so good intuition, wrong witness ;-)
N25–N38 are 14 new bases with 13 clues.
N39 (16 clues) is marek stefanik’s pattern (2022), reposted by Serg in Oct 2024. It is also a base: all 16 of its 15-clue sub-patterns have minimal puzzles.

Remark: all 39 known bases fit in the union of one band and one stack.

Method

ED patterns were enumerated level by level (canonical forms with Dobrichev’s patminlex). Counts were checked with Burnside up to 12 clues.
A pattern that contains a known base is non-minimal. For every other pattern, a minimal puzzle containing it was found, first by random search, then by a SAT-guided search. Samples were re-checked with an independent program.
New bases were proven with the forced-clue criterion: for every filling of the pattern, one clue is forced by the others (SAT). This was confirmed by enumerating all fillings: 5,400 to 69,120 for the 13-clue bases, 765,504 for N39.

N23–N38 are oriented with the band holding the most clues on top and the stack holding the most clues on the left. Serg’s and marek’s grids are shown as they posted them.

Code: Select all
         N1 (9)                  N2 (7)                 N3 (12)
       JPF, 2007              ravel, 2007            Mauricio, 2007
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . x|     |. . .|x x x|x x x|
|x x x|x x x|x x x|     |x x x|x x x|. . .|     |. . .|x x x|x x x|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

         N4 (7)                  N5 (9)                  N6 (9)
     Mauricio, 2007            JPF, 2007             Serg, 2024 (*)
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|. . x|     |. . .|. . .|x x x|     |. . .|. . .|x x x|
|. . .|x x x|. . .|     |. . .|. . .|x x x|     |. . .|x x x|. . .|
|. . .|x x x|. . .|     |. . .|. . .|x x x|     |x x x|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N7 (11)                 N8 (11)                 N9 (12)
       Serg, 2024              Serg, 2024              Serg, 2024
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|x x x|     |. . .|. . .|x x x|     |. . .|. . .|x x x|
|. . x|. x x|. . .|     |. . x|. x x|. . .|     |. . x|. x x|. . x|
|. x x|x x x|. . .|     |x x .|x x x|. . .|     |x x x|. x x|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N10 (12)                N11 (12)                N12 (12)
       Serg, 2024              Serg, 2024              Serg, 2024
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|x x x|     |. . .|. . .|x x x|     |. . .|. . .|x x x|
|. . x|. x x|. . x|     |. . x|x x x|. . .|     |. . x|x x x|. . .|
|x x x|x . x|. . .|     |. x x|. x x|. . x|     |x x .|. x x|. . x|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N13 (12)                N14 (12)                N15 (12)
       Serg, 2024              Serg, 2024              Serg, 2024
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . x|. x x|     |. . .|. . x|. x x|     |. . .|. . x|. x x|
|. . .|x x x|. x x|     |. . .|x x x|. x x|     |. . .|x x x|x . x|
|x x x|. . .|. . x|     |x x x|. . .|x . .|     |x x x|. . .|. . x|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N16 (12)                N17 (12)                N18 (12)
       Serg, 2024              Serg, 2024              Serg, 2024
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . x|. x x|     |. . .|. . x|. x x|     |. . .|. . x|x x x|
|. . .|x x x|x . x|     |. . .|x x x|x . x|     |. . .|. x x|. x x|
|x x x|. . .|. x .|     |x x x|. . .|x . .|     |x x x|. . x|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N19 (12)                N20 (12)                N21 (12)
       Serg, 2024              Serg, 2024              Serg, 2024
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . x|x x x|     |. . .|. . x|x x x|     |. . .|. . x|x x x|
|. . .|. x x|. x x|     |. . .|. x x|. x x|     |. . .|x x .|. x x|
|x x x|. x .|. . .|     |x x x|x . .|. . .|     |x x x|. . x|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N22 (12)
       Serg, 2024
+-----+-----+-----+
|. . .|. . x|x x x|
|. . .|x x .|. x x|
|x x x|. x .|. . .|
+-----+-----+-----+

        N23 (9)                 N24 (12)                N25 (13)
     Mauricio, 2007            JPF, 2026               JPF, 2026
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x x x|x x x|x x .|     |x x .|x x x|. . .|     |. . .|x x x|x x .|
|. . .|. . .|. . .|     |x x .|x . .|. . .|     |. x x|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|x x x|     |. x x|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|. . x|     |. . x|. . .|. . .|     |x . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |x . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |x . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |x . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N26 (13)                N27 (13)                N28 (13)
       JPF, 2026               JPF, 2026               JPF, 2026
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|x x x|x x .|     |x . .|x x x|x . .|     |x . .|x x .|x x .|
|. x x|. . .|. . .|     |. x x|. . .|. . .|     |. x x|. . .|. . .|
|. x x|. . .|. . .|     |. x x|. . .|. . .|     |. x x|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|. . .|. . .|     |x . .|. . .|. . .|     |x . .|. . .|. . .|
|x . .|. . .|. . .|     |x . .|. . .|. . .|     |x . .|. . .|. . .|
|x . .|. . .|. . .|     |x . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|. . .|. . .|     |x . .|. . .|. . .|     |x . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |x . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N29 (13)                N30 (13)                N31 (13)
       JPF, 2026               JPF, 2026               JPF, 2026
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|x x x|x . .|     |x x x|x . .|. . .|     |x x x|x . .|. . .|
|. x x|. . .|. . .|     |x x .|. x x|. . .|     |x x .|. x x|. . .|
|. x x|. . .|. . .|     |. . .|. . .|x x x|     |. . .|. . .|x x x|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|. . .|. . .|     |. . .|x . .|. . .|     |. . .|x . .|. . .|
|x . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|x . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|. . .|. . .|     |. . .|x . .|. . .|     |. . .|. . .|. . .|
|x . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N32 (13)                N33 (13)                N34 (13)
       JPF, 2026               JPF, 2026               JPF, 2026
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|x x x|x x .|     |x . .|x x x|x x .|     |x x .|x x x|. . .|
|. x x|. . .|. . .|     |. x x|. . .|. . .|     |. x x|x . .|. . .|
|. x x|. . .|. . .|     |. x x|. . .|. . .|     |. . .|. . .|x x x|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|. . .|. . .|     |x . .|. . .|. . .|     |x . .|. . .|. . .|
|x . .|. . .|. . .|     |x . .|. . .|. . .|     |. . .|. . .|. . .|
|. . .|. . .|. . .|     |x . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|. . .|. . .|     |. . .|. . .|. . .|     |x . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N35 (13)                N36 (13)                N37 (13)
       JPF, 2026               JPF, 2026               JPF, 2026
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x x .|x x x|. . .|     |x . .|x x x|x x x|     |. . x|x x x|x x x|
|. x x|x . .|. . .|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
|. . .|. . .|x x x|     |. . .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|x . .|. . .|. . .|     |x . .|. . .|. . .|     |x . .|. . .|. . .|
|x . .|. . .|. . .|     |x . .|. . .|. . .|     |x . .|. . .|. . .|
|. . .|. . .|. . .|     |x . .|. . .|. . .|     |x . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+
|. . .|. . .|. . .|     |x . .|. . .|. . .|     |. x .|. . .|. . .|
|. . .|. . .|. . .|     |x . .|. . .|. . .|     |. x .|. . .|. . .|
|. . .|. . .|. . .|     |x . .|. . .|. . .|     |. x .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+     +-----+-----+-----+

        N38 (13)                N39 (16)
       JPF, 2026       marek stefanik, 2022 (**)
+-----+-----+-----+     +-----+-----+-----+
|x . .|x x x|x x x|     |x x x|x . x|. . .|
|. . .|. . .|. . .|     |. . .|. . .|. . .|
|. . .|. . .|. . .|     |x x x|x . x|. . .|
+-----+-----+-----+     +-----+-----+-----+
|x . .|. . .|. . .|     |. . .|x . x|. . .|
|x . .|. . .|. . .|     |. . .|x . x|. . .|
|x . .|. . .|. . .|     |. . .|x . x|. . .|
+-----+-----+-----+     +-----+-----+-----+
|. x .|. . .|. . .|     |. . .|. . .|. . .|
|. x .|. . .|. . .|     |. . .|. . .|. . .|
|. x .|. . .|. . .|     |. . .|. . .|. . .|
+-----+-----+-----+     +-----+-----+-----+


(*) N6: Serg’s proof, completed by blue.
(**) N39: marek stefanik, “Homework exercise”, Jan 30, 2022, with a multifish proof (18 givens needed in 16 cells). It is the non-minimal part of his 18-clue pattern posted in “More Homework !” on Jan 26, 2022. Serg reposted it in Oct 2024.

Computations were done with the help of Claude (AI).

JPF
JPF
2017 Supporter
 
Posts: 6153
Joined: 06 December 2005
Location: Paris, France

Previous

Return to General