Solves Tetris and Soma cubes.

Experimenting sudoku solver with OpenCV

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

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

Simple sudoku solver using dancing links

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

Цель проекта - разместить заданный набор тетриминок (фигурок тетриса, состоящих из 4 блоков) в квадратной области наименьшей площади так, чтобы тетриминки не пересекались друг с другом (незаполненные «дырки» в области допускаются). При реализации использовалась интерпретация Алгоритма Х Д.Кнута с использованием техники “танцующих ссылок”.

Rust implementation of Knuth's Algorithm X for solving exact cover problems

Algorithm X dancing links solver for fillit puzzle

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

Generic, reusable and well documented public domain "exact cover with colors" solver, with examples. (Backup repository)

Knuth and Pryanik

Nienna - A Combinatorial Problem solver using Knuth's algorithm X.

Java implementation of a simple backtracking sudoku solver and a sudoku solver using Algorithm X and Dancing Links by Donald Knuth

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

Tetromino puzzle solver using Algorithm X

Animated solutions to the pentomino problem using Don Knuth's algorithm X. (Why didn't I write unit tests???)

Algorithm X and Dancing Links Visualizer

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

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