Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
