A simple and hackable exact cover solver inspired by Donald Knuth's Fascicle 5
-
Updated
May 17, 2024 - C
#
knuth-algorithm-x
Here are 11 public repositories matching this topic...
Learning github with Hackathon's help :D
-
Updated
Oct 21, 2023 - JavaScript
Rust implementation of Knuth's Algorithm X for solving exact cover problems
-
Updated
Apr 17, 2024 - Rust
C++ Implementation of Dancing Links Algorithm
algorithms cpp backtracking brute-force dancing-links backtracking-algorithm exact-cover dancing-links-algorithms knuth-algorithm-x exact-cover-problem
-
Updated
Jun 8, 2022 - C++
General puzzle solver with DLX
-
Updated
Jan 13, 2021 - C++
A solver for the EXACTCOVER problem based on Knuth's dancing links technique, in Lua.
-
Updated
Jan 23, 2024 - TeX
A Sudoku Solver using AI to identify the digits and Knuth's X Algorithm to solve the grid.
-
Updated
Jun 10, 2021 - Python
A C library implementation of Knuth's Algorithm X with dancing links.
-
Updated
May 20, 2022 - C
-
Updated
Jun 11, 2024 - Python
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.
javascript ruby android kotlin java go html algorithm mobile js box algorithms-and-data-structures knuth-morris-pratt knuth-algorithm kmp knuth-shuffling-algorithm kmm knuth-algorithm-x
-
Updated
Feb 13, 2023 - Kotlin
Nienna - A Combinatorial Problem solver using Knuth's algorithm X.
-
Updated
Nov 29, 2023 - Go
Improve this page
Add a description, image, and links to the knuth-algorithm-x topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the knuth-algorithm-x topic, visit your repo's landing page and select "manage topics."