Sudoku is an interesting number placement puzzle with some simple rules. For some positive integer [Formula: see text], the puzzle involves an [Formula: see text] grid partitioned into [Formula: see text] distinct blocks each of size [Formula: see text] such that the integers [Formula: see text] through [Formula: see text] appear exactly once in each row, each column and each block of the grid. Often some static numbers known as givens are placed according to the difficulty rating in the puzzle and then the rule is to place the numbers from [Formula: see text] to [Formula: see text] in the partially filled grid such that the conditions of the puzzle are satisfied. The aim of this paper is to propose a new algorithm for enumerating all possible Sudoku squares of size [Formula: see text]. It is based on the concepts of permutations derived from [Formula: see text] S-permutation matrices termed as S-permutations. There is a one-to-one correspondence between Sudoku squares and the set of those S-permutation matrices which are mutually disjoint to each other. The proposed algorithm uses the set of all S-permutations generated by some permutation generation algorithm as input and then enumerates all the subsets of cardinality [Formula: see text] of all S-permutations which are mutually disjoint to each other. The correctness of the algorithm is established. Its worst-case time complexity is O[Formula: see text], where [Formula: see text]. A mathematical formula involving the total number of the sets of [Formula: see text] mutually disjoint S-permutations is also derived. Experimentally, the proposed algorithm is verified for the Sudoku squares of size [Formula: see text]. It is observed that our algorithm is more systematic and better in terms of computational efficiency.
New Permutation Generation Under Exchange Strategy (PGuES)
