The New Sudoku Players' Forum

[tarek]

This variant seems to work as it will keep the spirit of clueless.

The idea is that instead of a 9+1 grids

You have 8+1

the one is the centre grid

The overlapping section would be the 8 boxes of that centre grid
the centre box of that centre grid will not overlap with any other grid

The centre grid will remain clueless.

you have for this variant 8*81+9=657 cells instead of the 729 cells for Clueless special or explosion.

here is a snap shot of it

The shaded blue areas are the overlapping parts
The Centre grid is clueles (That means the centre grid and the centre box in every grid).

Will attempt generating some to give a clear idea.



tarek

[udosuk]

Very nice idea.

Note the puzzle is also a Clueless Special by default - the centre nonets (boxes) of the 9 grids form a 10th Sudoku grid. It just has the added requirement that n5 of grid [X] is identical to n[X] of grid 5, for X=1 to 9.

Both of my puzzles from this thread should satisfy your description (except the "centre grid remains clueless" part).

[tarek]

Very nice idea.

Note the puzzle is also a Clueless Special by default - the centre nonets (boxes) of the 9 grids form a 10th Sudoku grid. It just has the added requirement that n5 of grid [X] is identical to n[X] of grid 5, for X=1 to 9.

Or that Grid 5 = Grid X Therfore there is no need to display Grid X

tarek

[enxio27]

Hmmm. . . Very interesting! When you have an actual puzzle, be sure to post it!

[tarek]

My slow generator is compiling one now.


It can be visualized best IMO as a clueless special by:
1. Stripping out Grid 5 completely (with Grid X still intact on the side)
2. Or if you don't like the overlapping parts showing more than once. Then strip out Grid X & leave only box five out of Grid five (strip out boxes 1,2,3,4,6,7,8,9).


Boxes 1,2,3,4,4,6,7,8,9 can be used as an aid. if you want to bring the overlapping bits closer to form one grid. In the regular Cluless Special Grid X (when used) is on an extra piece of screen or paper.

tarek

[tarek]

This is a puzzle (not minimal & all singles)

You can solve it as clueless special, as it is by default a clueless special.

you can use the boxes in grid 5 as aid, because grid 5 is now grid X

To generate this kind of puzzle, just generate a clueless special without clues in grid 5



Enjoy

[Pat]

how about a text version ?

[tarek]

I was pretty sure that I've put a text version (9 lines of text) below the image.

Unfortunately that is not the case & I'm not sure if I had it backed up somewhere else

will look for it.

tarek

[Glyn]

If Tarek can't track down the text here it is:

Code: Select all

471000000300002000008507416095000100002000008000000570510000039800070000000040080
007014000604008910002000004000000100005000008019000005000000040460500070000809000
000006002060012030000090000650000000701000004000000003500080007470000120090060008
080004100002705034000090000005000760130000000008000000000800010801057346000000070
000000000000000000000000000000000000000000000000000000000000000000000000000000000
003000059870490001506302000000000900029000610050000004000030000435000090007600840
070300090000982060010000080008000006037000000004000010400000000590046000000000643
000000230005079000800000960073000020000000009000000000109000300020090006307510800
015804700000009000023000000096000000400000009087000200054000807000000301002603500
000000000000000000000000000000000000000000000000000000000000000000000000000000000

JSudoku will not recognize this as valid input data due to the absence of any clues in Grid 5, something that was not anticipated. SudokuSolver doesn't do this pre-check so it is able to confirm it has a solution.

[tarek]

Thanks Glyn,

I guess validating the puzzle through a clueless special solver will result in multiple solution due to the empty grid 5.

The union of all solutions however sould show a unque solution for grids 1,2,3,4,6,7,8,9,X

tarek

[Jean-Christophe]

JSudoku will not recognize this as valid input data due to the absence of any clues in Grid 5, something that was not anticipated. SudokuSolver doesn't do this pre-check so it is able to confirm it has a solution.

It's OK but should have exactly 9 lines, not 10. The clueless is not read nor saved since all its cells are covered by the other grids.

This will work:

Code: Select all

471000000300002000008507416095000100002000008000000570510000039800070000000040080
007014000604008910002000004000000100005000008019000005000000040460500070000809000
000006002060012030000090000650000000701000004000000003500080007470000120090060008
080004100002705034000090000005000760130000000008000000000800010801057346000000070
000000000000000000000000000000000000000000000000000000000000000000000000000000000
003000059870490001506302000000000900029000610050000004000030000435000090007600840
070300090000982060010000080008000006037000000004000010400000000590046000000000643
000000230005079000800000960073000020000000009000000000109000300020090006307510800
015804700000009000023000000096000000400000009087000200054000807000000301002603500

[Glyn]

Thanks JC I created it in Richards Program, as I screwed up my first attempt in Notepad. I should have checked the number of lines.