🌳 Generate expression trees of arithmetic expressions 🌴

A experimental prover written in Common Lisp, based on clause resolution and Knuth-Bendix completion algorithm.

Coq proof of Bertrand's postulate on existence of primes [maintainer=@thery]

ID hashing based on Knuth's multiplicative hashing algorithm

Go package with 6 popular shuffling algorithms

A simulated elevator, for experimenting with different assignment algorithms

Swift implementation of Donald Knuth's multi-precision unsigned integer division Algorithm D, from The Art of Computer Programming, Vol 2: Semi-numerical Algorithms, Chapter 4.3.3

This is a java OOP of mastermind game and also includes an AI that use Knuth Algorithm to guess the code

Knuth and Pryanik

The Knuth-Morris-Pratt (KMP) algorithm is a linear time pattern matching algorithm that efficiently searches for occurrences of a pattern in a text. It pre-processes the pattern to determine a partial match table which is used to quickly skip over sections of the text that cannot match the pattern.

Badanie algorytmu ewolucyjnego do gry Mastermind

Design and Analysis of Algorithms, Assignment - BS CS Degree Program

Implements generalized Knuth's algorithm X with dancing links

Hide your message in a SUDOKU puzzle

Mastermind game project in OCaml with an AI (Knuth Algorithm)

The Knuth-Morris-Pratt (KMP) Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a preprocessing step to create a failure function, which helps skip irrelevant comparisons and improves its efficiency compared to a simple string matching algorithm.

Master mind game with single player mode, in which the computer follows Knuth's algorithm, & multiplayer mode.

Exact cover solution

Exploring sage math

Hostage situation negotiator simulation