hey, i'm sorry,
Lardarse — i guess what you really wanted was an explanation of the concept of
puzzleequivalence — perhaps this will help —
Gordon Royle wrote:Equivalent = can be translated to each other by any combination of the following operations:
 Permutations of the 9 digits
 Transposing the matrix (that is, exchanging rows and columns)
 Permuting rows within a band
 Permuting columns within a stack
 Permuting bands
 Permuting stacks
Rotations and reflections are already included in the above,
because they can be expressed as combinations of these operations.
Ed Russell and Frazer Jarvis (2006.Jan.25) wrote:We want to find all the operations that we can make on a general Sudoku grid which preserve the property that every row, column and box contains each of the digits 1–9 exactly once.
The complete list of operations that we can perform is:
 Relabel (i.e., permute) the 9 digits
 Permute the stacks
 Permute the bands
 Permute the columns within a stack
 Permute the rows within a band
 Any reflection or rotation
Lummox JR (2006.Mar.29) wrote:Two puzzles are equivalent if:
 The puzzle is transposed (flipped along a diagonal)
 The order of 9x3 and/or 3x9 bands is permuted
 The order of columns or rows within bands are permuted
 The digits are permuted

gsf (2006.Aug.23) wrote:the permutations that leave a sudoku unchanged are:
(a) rotate the grid 90 degrees
(b) swap the top two rows
(c) swap the top two bands
(d) swap any two cell values for all cells with those values
