coloin wrote:...

the two grid solutions have the same "bands" and can be transformed into each other

- Code: Select all
`C:\suxx>index416 test3.txt`

162 411 301 , 222 290 255

255 290 222 , 301 411 162

Red Ed knows all the grids which do this !!!!! He counted them up and posted

the Sudoku symmetry group

Thanks coloin,

I must say that your post is a bit crytic for me.

Sorry if I'm the only one !

What I understood :

The 2 following grids G1 and G2 are equivalent :

- Code: Select all
`123456789759328461648971253437582916986714325512639874895263147361847592274195638 `

123456789794328561658179243537942816946781325812635974485263197369817452271594638

I checked that by the only canonicalization programm I know how to use :

gsf's program :

- Code: Select all
`sudoku -qFN -f%%#0c puzzles.txt > puzzles.can`

btw, Is there a way to find one series of permutations which allows to go from G1 to G2 ?

Now,

My question* was related to one mutable cell in one valid puzzle.

How to use your observation for this specific question ?

Thanks,

JPF

*The question is : is there any specific properties for the puzzles P such that Mut(P)~P

Mut(P) is a (one cell) mutation of P.