🌳 Generate expression trees of arithmetic expressions 🌴

Go package with 6 popular shuffling algorithms

ID hashing based on Knuth's multiplicative hashing algorithm

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

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

A simulated elevator, for experimenting with different assignment algorithms

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

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

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.

Knuth and Pryanik

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

Badanie algorytmu ewolucyjnego do gry Mastermind

Exact cover solution

Mastermind Game (console, code maker & solver) ... with a setup, various algorithms and statistic loop

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

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.

Implements generalized Knuth's algorithm X with dancing links

Hide your message in a SUDOKU puzzle

Command line implementation of the board game Mastermind for a Software Engineering class