A general pattern-based solver of finite Constraint Satisfaction problems
Perecian is an open source CLI program for writers and educators.
Easy-to-use software for calculating and counting the number of Latin squares in the user's given order, this program can perform any order without computational limitations.
Fastest algorithm to generate a Latin square in Order of N. Powered by C language.
An exercise in creating Latin Squares and investigation into backtracking algorithms
Completion and embedding of latin squares in R.
latinsquare is a GAP package designed to generate and count Latin squares of order n. Latin squares are n × n grids filled with n distinct symbols, each occurring exactly once in each row and each column—a fundamental structure in combinatorics, design theory, and algebra.
Extending latin rectangles in R using Ryser's theorem and {keedwell}.
Latin squares and related designs.
Completing partial latin squares in Python with ryser.
Generate PSSSODLS in Minion format.
Complex comparative experiments (MAT 458)
Sandpile experiments over various hypergraphs that can be represented as grids
Enumeration of latin squares with R and Minion.
I did internship at IIT hyderabad and worked on determining the number of sets of permutations, in which n distinct objects can be permutated without repeating the position of any object. The number was determined algorithmically using C program and later was found to be related to a number of Latin squares of order N
Generate maximal partial Room squares.
Latin Square Completion Problem generator
The implementation of the paper Solving the Latin Square Completion Problem by Memetic Graph Coloring
A new computational fast algorithm of constructing semi-cyclic pandiagonal Latin squares for an arbitrary order.
Add a description, image, and links to the latin-squares topic page so that developers can more easily learn about it.
To associate your repository with the latin-squares topic, visit your repo's landing page and select "manage topics."