Computer program for magic squares
This thesis aims to construct a computer program that generates a magic square of any order greater than 2 and less than 181. A magic square is a sqare array of n2 distinct positive integers such that the sum of n numbers lying in any horizontal, vertical, or main diagonal line is always the same. M...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1993
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16098 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This thesis aims to construct a computer program that generates a magic square of any order greater than 2 and less than 181. A magic square is a sqare array of n2 distinct positive integers such that the sum of n numbers lying in any horizontal, vertical, or main diagonal line is always the same. Magic squares can be divided into three types: odd-order magic squares where n - 2m + 1 singly-even magic squares where n = 2(2m + 1) and doubly-even magic squares where n = 2(2m), where n and more positive integers. There are several methods to construct magic squares but only three distinct methods are used in the computer program to construct each type of magic square.Any magic square may be subjected to transformations which affect one's manner of looking at the square. These transformations are generated by two basic operations - rotation through a right angle and reflection in a mirror. Starting from any one magic square, seven additional magic squares may be produced in this manner. Rotations and reflections will also be generated by the computer program. |
|---|