- Code: Select all
. . . | . 8 9 | . 5 3
. . . | 5 6 . | 2 8 .
. . . | 7 3 . | 1 9 .
-------+-------+-------
. 4 2 | . 9 7 | . . .
5 1 . | 3 2 . | . . .
3 8 . | 4 1 . | . . .
-------+-------+-------
. 2 5 | . 4 3 | . . .
8 9 . | 1 5 . | . . .
4 3 . | 9 7 . | . . .
Such a sudoku could be called a fractal sudoku.
Another fractal sudoku pattern is
- Code: Select all
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
Are there any puzzles with this pattern?
There are at most 2^9=512 possible fractal sudoku patterns. JPF asked how many are valid, and how many there are up to equivalence.
Here's a first attempt at some counting. There are 2^3=8 possible patterns for a row (in a 3x3 box). Therefore there are 7^3=343 patterns that have no empty row. Of these, 3^3 -3=78 have an empty column. So 343-78=265 patterns have no empty row and no empty column.
This means there are at most 265 valid patterns, if I have counted right.
But not all these are valid. Some of these have 5 or 6 empty boxes, such as
xoo
oxo
oox
which we know is not possible. I haven't counted these yet.