a program to fill the smallest square with given tetrominos (using Knuth's Algorithm X)

Sudoku solver, the functional way

Solve any sudoku puzzle using Algorithm X

Simple sudoku solver using dancing links

A Sudoku solver implemented using Knuth's Algorithm X

Fillit is a program, which find the smallest square from "Tetris" shapes

Algorithm X dancing links solver for fillit puzzle

Knuth and Pryanik

Solves Tetris and Soma cubes.

This project aims to solve Sudoku puzzles using a variety of algorithms such as Breadth and Depth First Search, Algorithm X, DLX, as well as their greedy variants.

Simple but fast constraint solver for sudoku (N x N).

C++ implementation of Donald Knuth's Algorithm X using the Dancing Links technique(DLX Algorithm).

Swift implementations of Knuth's Dancing Links algorithm

Experimenting sudoku solver with OpenCV

Solutions to the homework problems presented in Artificial intelligence and Machine learning courses.

An implementation of Donald Knuth's Algorithm X (that solves the exact cover problem). For educational purposes.

Visualization of the algorithms needed to solve three-dimensional knapsack problems.

A C library implementation of Knuth's Algorithm X with dancing links.

An efficient backtracking algorithm that solves instances of the Exact Cover problem.

Sudoku bot written in Python, with Algorithm X Solver written in Rust