Just to be clear, this puzzle:
- Code: Select all
+---+---+---+
|...|..2|..8|
|..2|7..|1..|
|.6.|.9.|.2.|
+---+---+---+
|.1.|4..|..9|
|..9|.6.|7..|
|3..|...|.5.|
+---+---+---+
|.2.|.5.|.4.|
|..4|..8|5..|
|5..|1..|..3|
+---+---+---+
- Code: Select all
000002008002700100060090020010400009009060700300000050020050040004008500500100003
or:
- Code: Select all
.....2..8..27..1...6..9..2..1.4....9..9.6.7..3......5..2..5..4...4..85..5..1....3
where . stands for 0.
What is the smallest (valid) minimal puzzle? i.e. having the minimum Lex representation?
JPF