A while ago i posted here on various patterns of clues which dont have puzzles.
Somewhat unsatisfactorily proof was distinctly lacking however.
So this thread takes it furthur - if it is possible.
Serg and blue have taken careful work to tabulate patterns which cant have puzzles with proof.
one clue box patterns
investigation of one band free patterns
investigation of one crossing free patterns
Other relevant threads
minimal patterns
number of non-equivalent patterns having n clues
number of minimal puzzles per ed valid pattern with n clues
Proof that patterns dont have puzzles is established either by
iterating through all possible ED options for the clues
or
showing that all ways to fill the empty spaces in a puzzle will always have an unavoidable set not hit by a clue.
Potential patterns can be disregarded if they are solely composed of clues from proven invalid maximal patterns.
3 Invalid patterns
1.Trivially this was first done with this pattern which needs 1 clue in 2 rows [always at least 1 UA]
2.Three empty box pattern was shown - to require one clue. [always at least 1 UA]here.
3.this also means that the four box pattern therefore requires at least two clues and this is indeed the case. [always at least 2 UAs]
- Code: Select all
Maximal invalid pattern
#1.+---+---+---+ #2.+---+---+---+
|...|...|...| |...|...|xxx|
|...|...|...| |...|...|xxx|
|xxx|xxx|xxx| |...|...|xxx|
+---+---+---+ +---+---+---+
|xxx|xxx|xxx| |...|xxx|xxx|
|xxx|xxx|xxx| |...|xxx|xxx|
|xxx|xxx|xxx| |...|xxx|xxx|
+---+---+---+ +---+---+---+
|xxx|xxx|xxx| |xxx|xxx|xxx|
|xxx|xxx|xxx| |xxx|xxx|xxx|
|xxx|xxx|xxx| |xxx|xxx|xxx|
+---+---+---+ +---+---+---+
Valid puzzle example with one added clue
1.+---+---+---+ 2.+---+---+---+
|...|...|..6| |7..|...|298|
|...|...|...| |...|...|536|
|123|456|789| |...|...|471|
+---+---+---+ +---+---+---+
|812|547|963| |...|981|623|
|674|293|518| |...|364|857|
|539|861|274| |...|572|914|
+---+---+---+ +---+---+---+
|756|938|421| |123|456|789|
|298|174|635| |678|293|145|
|341|625|897| |495|817|362|
+---+---+---+ +---+---+---+
Valid puzzle example with two added clues
+---+---+---+ +---+---+---+
|...|...|xxx| |5..|...|672|
|...|...|xxx| |...|...|134|
|...|...|xxx| |...|...|895|
+---+---+---+ +---+---+---+
|...|...|xxx| |...|9..|428|
|...|...|xxx| |...|...|517|
|...|...|xxx| |...|...|963|
+---+---+---+ +---+---+---+
|xxx|xxx|xxx| |123|456|789|
|xxx|xxx|xxx| |749|218|356|
|xxx|xxx|xxx| |658|379|241|
+---+---+---+ +---+---+---+
Maximal invalid pattern
#3.+---+---+---+
|x..|x..|xxx|
|...|...|xxx|
|...|...|xxx|
+---+---+---+
|...|...|xxx|
|...|...|xxx|
|...|...|xxx|
+---+---+---+
|xxx|xxx|xxx|
|xxx|xxx|xxx|
|xxx|xxx|xxx|
+---+---+---+
4.Red Ed classically
showed that this pattern would always have an uncovered unavoidable set [UA].
The computation was made many times easier using the fact that the empty area had many planes of symmetry.
- Code: Select all
+---+---+---+ +---+---+---+
|xxx|xxx|xxx| |...|..x|..x|
|xxx|...|xxx| |...|..x|..x|
|xxx|...|xxx| |..x|..x|..x|
+---+---+---+ +---+---+---+
|x..|...|..x| |...|xxx|xxx|
|x..|.x.|..x| -> |...|xxx|xxx|
|x..|...|..x| |xxx|xxx|xxx|
+---+---+---+ +---+---+---+
|xxx|...|xxx| |...|xxx|xxx|
|xxx|...|xxx| |...|xxx|xxx|
|xxx|xxx|xxx| |xxx|xxx|xxx|
+---+---+---+ +---+---+---+ [morph]
a variation produced similarly is maximal......with no clue in central box
- Code: Select all
+---+---+---+ +---+---+---+
|xxx|xxx|xxx| |...|..x|.xx|
|xxx|...|xxx| |...|..x|.xx|
|xxx|...|xxx| |...|..x|.xx|
+---+---+---+ +---+---+---+
|x..|...|.xx| |...|xxx|xxx|
|x..|...|.xx| -> |...|xxx|xxx|
|x..|...|.xx| |xxx|xxx|xxx|
+---+---+---+ +---+---+---+
|xxx|...|xxx| |...|xxx|xxx|
|xxx|xxx|xxx| |xxx|xxx|xxx|
|xxx|xxx|xxx| |xxx|xxx|xxx|
+---+---+---+ +---+---+---+ [morph]
3 clues in the 49 cells cant therefore give valid puzzles
- Code: Select all
+---+---+---+
|...|..x|.xx|
|...|...|.xx|
|...|...|.xx|
+---+---+---+
|...|...|.xx|
|...|...|.xx|
|x..|..x|.xx|
+---+---+---+
|...|...|.xx|
|xxx|xxx|xxx|
|xxx|xxx|xxx|
+---+---+---+
4 clues in the 49 empty cells are can give valid puzzles
But these 2 ED ways can be shown to be invalid
- Code: Select all
+---+---+---+ +---+---+---+
|x..|x..|.xx| |x..|.x.|.xx|
|...|...|.xx| |...|...|.xx|
|...|...|.xx| |...|...|.xx|
+---+---+---+ +---+---+---+
|x..|x..|.xx| |x..|x..|.xx|
|...|...|.xx| |...|...|.xx|
|...|...|.xx| |...|...|.xx|
+---+---+---+ +---+---+---+
|...|...|.xx| |...|...|.xx|
|xxx|xxx|xxx| |xxx|xxx|xxx|
|xxx|xxx|xxx| |xxx|xxx|xxx|
+---+---+---+ +---+---+---+ [blue]
here
And these 4 other ED ways can be shown to have valid puzzles [blue]
- Code: Select all
+---+---+---+ +---+---+---+ +---+---+---+ +---+---+---+
|x..|.x.|.xx| |x..|x..|.xx| |x..|.x.|.xx| |x..|...|.xx|
|...|...|.xx| |...|...|.xx| |...|...|.xx| |...|.x.|.xx|
|...|...|.xx| |...|...|.xx| |...|...|.xx| |...|...|.xx|
+---+---+---+ +---+---+---+ +---+---+---+ +---+---+---+
|...|x..|.xx| |...|x..|.xx| |.x.|x..|.xx| |...|x..|.xx|
|x..|...|.xx| |x..|...|.xx| |...|...|.xx| |.x.|...|.xx|
|...|...|.xx| |...|...|.xx| |...|...|.xx| |...|...|.xx|
+---+---+---+ +---+---+---+ +---+---+---+ +---+---+---+
|...|...|.xx| |...|...|.xx| |...|...|.xx| |...|...|.xx|
|xxx|xxx|xxx| |xxx|xxx|xxx| |xxx|xxx|xxx| |xxx|xxx|xxx|
|xxx|xxx|xxx| |xxx|xxx|xxx| |xxx|xxx|xxx| |xxx|xxx|xxx|
+---+---+---+ +---+---+---+ +---+---+---+ +---+---+---+
Finally blue also easily proved that a crossing pattern with 2 rows and 2 columns
was shown to always need more than one clue [always at 2 least UAs] and his methods gave rise to many other maximal patterns.
- Code: Select all
+---+---+---+ +---+---+---+
|...|...|...| |2..|...|...|
|...|...|...| |.6.|...|...|
|..x|xxx|xxx| |..4|861|792|
+---+---+---+ +---+---+---+
|..x|xxx|xxx| |..9|123|846|
|..x|xxx|xxx| |..2|456|379|
|..x|xxx|xxx| |..6|789|215|
+---+---+---+ +---+---+---+
|..x|xxx|xxx| |..1|937|528|
|..x|xxx|xxx| |..3|548|167|
|..x|xxx|xxx| |..5|612|934|
+---+---+---+ +---+---+---+ needs 2 clues
More to follow