In this thread, I used "SudokuPX" to describe generalised SudokuP puzzles in which the PSET can be any partition of the cells into 9 sets of 9 cells.
tarek posted some interesting 8-clue examples.
There are two aesthetical problems concerning our examples:
- calling them SudokuPX was a bad move, the X suffix should only be used for a variant in which distinct diagonal entries are added to the constraints
- the puzzles I showed have no practical use, in that displaying them requires either colouring or cell labelling
The display formatting issues largely disappear if we require that our PSETS are contiguous (as in conventional Jigsaw Sudoku) and so I propose calling these puzzles SudokuCP (contig partitions).
Here is an 8-clue example. Hopefully some intrepid puzzler will solve it and report back on apparent difficulty:
- SudokuCP (Example #1)
- SudokuCP-8C.jpg (20.38 KiB) Viewed 820 times
I have used bold lines for the jigsaw outlines, and lightly shaded alternate boxes to remind one of the box constraints that still apply. The format has the desirable property that it uses no colours, no cell labelling tricks, and is printer-friendly.
For text-mode display purposes, I have omitted the box outlines, but these are contextually implicit :
Hidden Text: Show
Puzzle definition requires puzzle + PSET (1 or 2 line formats):
- Code: Select all
.........3...2..............8.......5...4............1.......7............6......
ABBBBBBCCAABBDCBCCAAADDCCCCADDDEEEEEAADEEEFFEGDDHFFFFFGHHHHHFFIGGHGIHHIIGGGGIIIII
