Properties, Isomorphisms and Enumeration of 2-Quasi-Magic Sudoku Grids

Sian-Kathryn Jones, Stephanie Perkins, Paul Roach

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

Crynodeb

A Sudoku grid is a 9 × 9 Latin square further constrained to have nine non-overlapping 3×3 mini-grids each of which contains the values 1–9. In ?-Quasi-Magic Sudoku a further constraint is imposed such that every row, column and diagonal in each mini-grid sums to an integer in the interval [15-?, 15+?]. The problem of proving certain (computationally known) results for ? = 2 concerning mini-grids and bands (rows of mini-grids) was posed at the British Combinatorial Conference in 2007. These proofs are presented and extensions of these provide a full combinatorial enumeration for the total number of completed 2-Quasi-Magic Sudoku grids. It is also shown that there are 40 isomorphism classes of completed 2-Quasi-Magic Sudoku grids.
Iaith wreiddiolSaesneg
Tudalennau (o-i)1098 - 1110
Nifer y tudalennau12
CyfnodolynDiscrete Mathematics
Cyfrol311
Rhif cyhoeddi1
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 1 Ion 2011

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Properties, Isomorphisms and Enumeration of 2-Quasi-Magic Sudoku Grids'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn