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.

Latin Square

Fastest algorithm to generate a Latin square in Order of N. Powered by C language.

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.

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.

Projects

A new computational fast algorithm of constructing semi-cyclic pandiagonal Latin squares for an arbitrary order.

Contains all the assignments of the course CSE-318 offered in CSE, BUET

Latin Square Completion Problem generator

Implementation of A* Search, Constraint Satisfaction Problem, Local Search and Knowledge Engineering

Latin Square Solver using logic-solver

This library proposes a plug-in approach to active learning utilizing bagging techniques. Bagging, or bootstrap aggregating, is an ensemble learning method designed to improve the stability and accuracy of machine learning algorithms.

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.