Problem magic square #11
Description
Hallo Guys
i am new in programming prolog. Now i have a problem to solve the a magic issue. This is the problem which i have to solve
/*Implement the a EA version of the "Magic Square" finder of size N in prolog including a makefile (make test shall test all cases) compressed into a ZIP or tgz file. Test your program from size N= 3 up to 9 (and more if possible) and find 5 new ones, that differ from wikipedia.
I would recommend, that you modify the "8-queens problem" finder or "the simple EA" accordingly.
Your group has to implement the magic square version equal to its group number mod(12).*/
Franklin magic square when it is a doubly even magic square with three further properties
(i) every bent diagonal adds to the magic constant,
(ii) every half row and half column starting at an outside edge adds to half the magic constant, and
(iii) the square is compact.
Thanks