This repository contains Local Search Algorithms implemented on Magic Square problem.

A magic square of order n is an arrangement of n2 numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. A magic square contains the integers from 1 to n2.

A program to the calculate the total minimal cost of converting the input square ( 3x3 matrix ) to a magic square

Genetic Algorithm based Magicsquare Search

This is a project I've been working on in Rust, exploring concepts behind Lo Shu, or more commonly, magic squares. This project will aim to solve various problems in combinatorics utilizing accellerated computing as well as enhance my understanding of the Rust Programming Language.

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.

This repository includes a Sudoku solver and a Magic Square puzzle solver. The Sudoku solver employs backtracking search with heuristics and the AC-3 algorithm. The Magic Square solver uses a genetic algorithm to solve 3x3 puzzles. Both solvers are implemented in Python with efficient and optimized approaches.

Genetic Algorithm which finds a possible sequence for numbers in a 3x3 matric with all diagonals, rows and columns adding up to the same sum

This repository contains codes for implementing Constraint satisfaction, A-star algorithm, hill-climb algorithm, BFS, DFS, Best first search, Magic square, Tic-Tac-Toe using magic square and the classic N-Queens problem