How to resolve the algorithm Magic squares of odd order step by step in the Ring programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Magic squares of odd order step by step in the Ring programming language

Table of Contents

Problem Statement

A magic square is an   NxN   square matrix whose numbers (usually integers) consist of consecutive numbers arranged so that the sum of each row and column,   and   both long (main) diagonals are equal to the same sum (which is called the   magic number   or   magic constant). The numbers are usually (but not always) the first   N2   positive integers. A magic square whose rows and columns add up to a magic number but whose main diagonals do not, is known as a semimagic square.

For any odd   N,   generate a magic square with the integers   1 ──► N,   and show the results here. Optionally, show the magic number.
You should demonstrate the generator by showing at least a magic square for   N = 5.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Magic squares of odd order step by step in the Ring programming language

Source code in the ring programming language

n=9
see "the square order is : " + n + nl
for i=1 to n 
    for j = 1 to n 
        x = (i*2-j+n-1) % n*n + (i*2+j-2) % n + 1
        see "" + x + " "
    next
    see nl
next
see "the magic number is : " + n*(n*n+1) / 2 + nl

  

You may also check:How to resolve the algorithm Playing cards step by step in the Fortran programming language
You may also check:How to resolve the algorithm Greatest common divisor step by step in the Modula-3 programming language
You may also check:How to resolve the algorithm Sum of a series step by step in the Racket programming language
You may also check:How to resolve the algorithm Roots of unity step by step in the Go programming language
You may also check:How to resolve the algorithm Handle a signal step by step in the Java programming language