Magic Square Finder in Java using combination trees and object-orientated design principles. The algorithm will search and find all N*N magic squares.
This is a C project. The user inserts 2 numbers, and then the program creates and shows the magic square that these 2 numbers create.
This module makes it possible to check if a matrix is a magic square or not. As a reminder, a magic square is a matrix N * N whose numbers are distinct and between 1 and (N * N) where the sum of a line, a column or a diagonal is always equal to the same number.
Python Programs
Simple magic square rule based Tic Tac Toe game using java and JavaFX for GUI
Program to find magic squares with user-given parameters
Add a description, image, and links to the magic-square-solver topic page so that developers can more easily learn about it.
To associate your repository with the magic-square-solver topic, visit your repo's landing page and select "manage topics."