- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

International Journal of Combinatorics

Volume 2012 (2012), Article ID 760310, 6 pages

http://dx.doi.org/10.1155/2012/760310

## The Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group

Department of Computing and Mathematical Sciences, University of Glamorgan, Pontypridd CF37 1DL, UK

Received 10 May 2012; Accepted 28 September 2012

Academic Editor: Martin Kochol

Copyright © 2012 Siân K. Jones et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

A Sudoku grid is a constrained Latin square. In this paper a reduced Sudoku grid is described, the properties of which differ, through necessity, from that of a reduced Latin square. The Sudoku symmetry group is presented and applied to determine a mathematical relationship between the number of reduced Sudoku grids and the total number of Sudoku grids for any size. This relationship simplifies the enumeration of Sudoku grids and an example of the use of this method is given.

#### 1. Introduction

A Sudoku grid, , is a array subdivided into minigrids of size (where . consists of *bands*, each composed of horizontally consecutive minigrids, and *stacks*, each composed of vertically consecutive minigrids. Each minigrid possesses subrows, or *tiers* and subcolumns, or *pillars*. The values are contained within the array in such a way that each value occurs exactly once in every *row*, *column*, and *minigrid*. The discussion that follows requires analysis of the enumeration of Sudoku grids and therefore the following notation is required: is the number of ways of arranging the values in .

A Sudoku grid is a constrained Latin square. The calculation of the number of Latin squares, of some dimension, is greatly simplified by only counting those Latin squares which are in *reduced* form. A Latin square, or rectangle, is reduced if the values in the first row and column are in the natural order [1]. There are far fewer reduced Latin squares than Latin squares, and there exists a mathematical relationship allowing a direct calculation of the number of the latter from the number of the former. If the first row and first column of a Sudoku grid are in the natural order there is no longer a direct mathematical relationship between the number of these and the number of Sudoku grids. Therefore reduced Sudoku grids, defined in this paper, have different properties to reduced Latin squares.

In [2–5] the number of reduced Latin squares (for sizes 8 to 11) is calculated. In a recent article, Stones [6] surveys some well-known and some more recent formulae for Latin rectangles, their usefulness, and means to obtain approximate numbers. If is the number of reduced Latin rectangles of size then the total number of Latin rectangles, , [1] is as follows: A similar relationship is developed here between the total number of Sudoku grids and the number of reduced Sudoku grids. Such relationships have previously been given for “NRC-Sudoku” [7] and “2-Quasi-Magic Sudoku” [8] where the focus is the symmetry groups for these structures; symmetry groups have been defined for [9], [10], and the symmetry group of is given in this paper.

#### 2. The Sudoku Symmetry Group

The Sudoku symmetry group, , (containing symmetry operations applicable to ) consists of all homomorphisms of the structure of a Sudoku grid. An element of the symmetry group when applied to a Sudoku grid preserves the underlying structure of that grid (including the relationship between the values) while permuting the values contained within the grid. An element of the symmetry group operating on a Sudoku grid is written . For the symmetry group, identity is defined as . For any element in the symmetry group, if then the Sudoku grid is said to be “fixed” by the symmetry operation . For two Sudoku grids and , and two elements of the symmetry group and , if then and are said to be isomorphic.

*Definition 2.1. *The symmetry group, , for a Sudoku grid is formed by the permutations in Table 1.

By Definition 2.1 the Sudoku symmetry group consists of all permutation operations listed in Table 1 and any combination thereof. Each permutation operation is given in general and the order of each gives the total number of such operations. The cardinality of the Sudoku symmetry group is given by the product of the orders of each permutation operation:

#### 3. Reductions

The properties of a reduced Sudoku grid are given in Definition 3.1 and a direct mathematical relationship is given between the number of ways of arranging the values in a Sudoku grid and the number of ways of arranging the values in a reduced Sudoku grid, in Theorem 3.2. The reduced Sudoku properties are used in Section 4 to enable the simplification of the calculation of the number of ways of arranging the values in a Sudoku grid.

*Definition 3.1. *A *reduced Sudoku grid, **,* is a Sudoku grid, , having the following properties: (i)the values in are in canonical form, ; (ii)for each minigrid , for , the values in for are increasing; (iii)for each minigrid , for , the values in for are increasing; (iv) for ; (v) for .

An example reduced Sudoku grid is given in Figure 1(a), and an isomorphic Sudoku grid that can be formed from it (by permuting the values and permuting the rows and columns) is given in Figure 1(b).

Theorem 3.2. *If is the number of reduced Sudoku grids of size with minigrids of size (where ) then is given by the following:
*

*Proof. *Let a set contain all reduced Sudoku grids. There exists an such that for . Hence a count of the number of possible isomorphisms by applying the symmetry operations in will be larger than the number of distinct isomorphisms. The permutations in Table 2 contain all symmetry operations of , and form the group , and is such that if for then and for .

The cardinality of is given by the product of the order of the permutation operations in Table 2, and thus gives the number of isomorphic Sudoku grids which may be formed from a given reduced Sudoku grid. Thus the total number of Sudoku grids may be calculated from the total number of reduced Sudoku grids using the following:

Equation (3.2) can be simplified, since , to give (3.1).

#### 4. Example of the Enumeration Technique

Let a Sudoku grid be in reduced form such that: the values in are in canonical form, the values in for are increasing; the values in for are increasing (note that the remaining two properties of reduced Sudoku grids are not needed for since there are only two bands and two stacks). A partially filled reduced Sudoku grid is given in Figure 2 (containing only those values which are prearranged by the grid being in reduced form).

Consider the minigrid ; the values 1 and 2 must be contained in the second tier and there are two ways of arranging these values. Consider the minigrid ; the values 1 and 3 must be contained in the second pillar and there are two ways of arranging these values. Four grids are formed and are given in Figure 3. In Figures 3(a), 3(b), and 3(c) there is one way of arranging the values in and in Figure 3(d) there are no valid ways of arranging the values in ; therefore .

The enumeration of the number of grids has been greatly simplified by only calculating the number of reduced Sudoku grids. Using (3.1) in Theorem 3.2 the total number of grids can be calculated such that .

#### 5. Comparison of the Number of Known and Reduced Sudoku Grids

Exact values for are known for and . All results were calculated computationally and appeared around late 2005 on the Sudoku Players Forum [11], except for () which appeared in [12] in January 2006. All results have been confirmed computationally by other contributors to the forum. () is attributed to many different authors, (), (), and () are attributed to Pettersen [11]. The number () was calculated by Russel [11], () by Felgenhauer and Jarvis [12], and () by Pettersen and Silver [11]. Currently no other results are available in the academic or nonpeer-reviewed literature. Known numbers of Sudoku grids, , for some values of and are extended using Theorem 3.2 to produce a comparison of and ; these are shown in Table 3.

The link between Latin squares and reduced Latin squares has been employed to great advantage, especially within the field of enumerative combinatorics. Here we have introduced a reduced Sudoku grid which likewise simplifies the enumeration of Sudoku grids. It can be seen from Table 3 that there are far fewer reduced Sudoku grids than their regular counterparts and in Section 3 the mathematical link between them is demonstrated.

#### References

- C. F. Laywine and G. L. Mullen,
*Discrete Mathematics Using Latin Squares*, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, NY, USA, 1998. View at Zentralblatt MATH - M. B. Wells, “The number of Latin squares of order eight,”
*Journal of Combinatorial Theory*, vol. 3, pp. 98–99, 1967. View at Google Scholar · View at Zentralblatt MATH - S. E. Bammel and J. Rothstein, “The number of $9\times 9$ Latin squares,”
*Discrete Mathematics*, vol. 11, pp. 93–95, 1975. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - B. D. McKay and E. Rogoyski, “Latin squares of order 10,”
*Electronic Journal of Combinatorics*, vol. 2, no. 3, pp. 1–4, 1995. View at Google Scholar · View at Zentralblatt MATH - B. D. McKay and I. M. Wanless, “On the number of Latin squares,”
*Annals of Combinatorics*, vol. 9, no. 3, pp. 335–344, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - D. S. Stones, “The many formulae for the number of Latin rectangles,”
*Electronic Journal of Combinatorics*, vol. 17, no. 1, Article 1, 46 pages, 2010. View at Google Scholar · View at Zentralblatt MATH - B. Michel, “Mathematics of NRC-Sudoku,” Tech. Rep., Universiteit Utrecht, Utrecht, The Netherlands, 2007. View at Google Scholar
- S. K. Jones, S. Perkins, and P. A. Roach, “Properties, isomorphisms and enumeration of 2-Quasi-Magic Sudoku grids,”
*Discrete Mathematics*, vol. 311, no. 1, pp. 1098–1110, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - E. Russell and F. Jarvis, There are 49 essentially different Sudoku $2\times 3$ grids... and the $2\times 3$ Sudoku symmetry group, http://www.afjarvis.staff.shef.ac.uk/sudoku/sud23gp.html.
- E. Russell and F. Jarvis, “Mathematics of Sudoku II,”
*Mathematical Spectrum*, vol. 39, no. 2, pp. 54–58, 2007. View at Google Scholar - Forum Contributors, $4\times 3$ Sudoku counting (pg. 2), 2005, http://www.sudoku.com/boards/viewtopic.php?t=2511&start=17.
- B. Felgenhauer and F. Jarvis, “Mathematics of Sudoku I,”
*Mathematical Spectrum*, vol. 39, pp. 15–22, 2006. View at Google Scholar