Exponential Latin square, exponential Sudoku matrix and bitwise operations | Chapter 02 | Advances in Mathematics and Computer Science Vol. 1

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.

Author  Details:

Krasimir Yordzhev, DSc

Faculty of Mathematics and  Natural Sciences, South-West University, 2700 Blagoevgrad, Bulgaria

Read full article: http://bp.bookpi.org/index.php/bpi/catalog/view/46/220/376-2

View Volume: https://doi.org/10.9734/bpi/amacs/v1

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s