A general pattern-based solver of finite Constraint Satisfaction problems
-
Updated
Jun 20, 2026 - CLIPS
A general pattern-based solver of finite Constraint Satisfaction problems
Perecian is an open source CLI program for writers and educators.
Completion and embedding of latin squares in R.
Fastest algorithm to generate a Latin square in Order of N. Powered by C language.
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.
Suirodoku — The first playable Graeco-Latin Sudoku square combining digits and colors
Extending latin rectangles in R using Ryser's theorem and {keedwell}.
Lean 4 formalizations accompanying results on exact list-edge labelings of finite bipartite multigraphs.
Independent research demonstrating discovery of structural limits and binary emergence in ternary algebraic spaces (GL(3,F₃)), with reproducible computational proofs and published codebase (GAP + Python).
Latin squares and related designs.
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.
Python and GAP codes for analyzing regularity in Generalized Latin Square Graphs of finite semigroups. Accompanies the paper : A Counting Framework for Generalized Latin Square Graphs of Finite Semigroups
AI-generated research dossier on odd-cycle-free Latin squares, with computational evidence and explicit review limits.
The implementation of the paper Solving the Latin Square Completion Problem by Memetic Graph Coloring
Latin Square Completion Problem generator
Sandpile experiments over various hypergraphs that can be represented as grids
An exercise in creating Latin Squares and investigation into backtracking algorithms
Complex comparative experiments (MAT 458)
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.
To associate your repository with the latin-squares topic, visit your repo's landing page and select "manage topics."