1887

Abstract

In this paper we introduce and study special types of magic squares of order six. We list some enumerations of these squares. We present a parallelizable code. This code is based on the principles of genetic algorithms. A magic square is a square matrix, where the sum of all entries in each row or column and both main diagonals yields the same number. This number is called the magic constant. A natural magic square of order n is a matrix of size n×n such that its entries consist of all integers from one to square of n. We define a new class of magic squares and present some listing of the counting carried out over two years.

Loading

Article metrics loading...

/content/papers/10.5339/qfarc.2014.ITPP0393
2014-11-18
2020-08-09
Loading full text...

Full text loading...

http://instance.metastore.ingenta.com/content/papers/10.5339/qfarc.2014.ITPP0393
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error