Discovering magic squares in Tang Dynasty poems
-
Updated
Mar 26, 2021 - C
Discovering magic squares in Tang Dynasty poems
Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
Leonhard Euler's Magic Square
Magic Square Finder in Java using combination trees and object-orientated design principles. The algorithm will search and find all N*N magic squares.
The number of magic squares of a given dimension is mostly unknown. I wrote a program to quickly determine the number of all magic squares of dimension 4.
First Project of My University Life
collection of small algorithms
A website that constructs magic squares
Magic square finder (brute-force algorithm)
A small collection of Linear Algebra routines
A program written in C to search for Magic Square of Squares.
A program to the calculate the total minimal cost of converting the input square ( 3x3 matrix ) to a magic square
My python implementations of some genetic algorithms
Generate valid Magic square through branch and bound algorithm
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.
Magic Square nXn With JavaScript
A Tic-Tac-Toe Game with an unbeatable AI
Add a description, image, and links to the magic-square topic page so that developers can more easily learn about it.
To associate your repository with the magic-square topic, visit your repo's landing page and select "manage topics."