Python library for Design and Analysis of Experiments
-
Updated
Dec 8, 2020 - Python
Python library for Design and Analysis of Experiments
Latin Squares and Their Applications to Cryptography by N. O. Schmidt
Solving some AI Problems
Reads Latin squares from a file and outputs the line number of the valid ones, optionally concurrently.
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.
A program which will read a sudoku puzzle from a file (some examples are sudoku1.txt, sudoku2.txt, etc) and generate clauses in the DIMACS format for each sudoku puzzle in the files sudokuN.cnf, where N = 1, 2, ..., 5.
Projects
A new computational fast algorithm of constructing semi-cyclic pandiagonal Latin squares for an arbitrary order.
Latin Square Completion Problem generator
Contains all the assignments of the course CSE-318 offered in CSE, BUET
Latin Square Solver using logic-solver
Latin square generator and example password generator
Finds a solution for a given partially complete quasigroup (latin square). This code was written as a part of CSE318: Artificial Intelligence Sessional course work.
Add a description, image, and links to the latin-square topic page so that developers can more easily learn about it.
To associate your repository with the latin-square topic, visit your repo's landing page and select "manage topics."