Exponential Latin square, exponential Sudoku matrix and bitwise operations

  • Krasimir Yordzhev Faculty of Mathematics and Natural Sciences, South-West University, 2700 Blagoevgrad, Bulgaria.
Keywords: Bitwise operations, Integer representation of sets, Latin square, Exponential Latin square, Sudoku matrix, Exponential Sudoku matrix

Abstract

The main thrust of the paper is to provide an interesting and useful for students example of using bitwise operations in programming languages C ++ and Java. As an example, we describe an algorithm for receiving a Latin square of arbitrary order. So we will outline some techniques for the use of bitwise operations. The article considers also the special case when the Latin square is a Sudoku matrix

Published
2019-07-04
How to Cite
Yordzhev, K. (2019). Exponential Latin square, exponential Sudoku matrix and bitwise operations. Advances in Mathematics and Computer Science Vol. 1, 17-25. Retrieved from https://stm1.bookpi.org/index.php/amacs-v1/article/view/198