Affiliation:
1. Faculty of Mathematics and Natural Sciences, South-West University, Ivan Mihaylov 66, Blagoevgrad, 2700, Bulgaria
Abstract
This work examines the problem to describe an efficient algorithm for obtaining [Formula: see text] Sudoku matrices. For this purpose, we define the concepts of [Formula: see text] [Formula: see text]-matrix and disjoint [Formula: see text]-matrices. The paper, using the set-theoretical approach, describes an algorithm for obtaining [Formula: see text]-tuples of [Formula: see text] mutually disjoint [Formula: see text] matrices. We show that in input [Formula: see text] mutually disjoint [Formula: see text] matrices, it is not difficult to receive a Sudoku matrix.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics