Sudoku solver implementations in rust.
-
Updated
Nov 22, 2023 - Rust
Sudoku solver implementations in rust.
Fast Sudoku Solver that leverages bitmasks and the MRV heuristic to crack over 450.000 grids/second
Implementation Of The 🐴 Knight's Tour 🐴 Problem in Rust
A simple and fast implementation of backtrack solving of Sudokus
Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.
This project contains solutions for solving the max clique problem.
Sudoku solver using backtracking in Rust
Solving sudoku puzzles with backtracking and visualizing the entire process
Tape Planner is a tool for calculating the most efficient length segment combinationsts. It features implementations in both Python (using PyQt5) and Rust (using eframe/egui). The Python version focuses on ease of development, while the Rust version emphasizes performance.
A dynamic sudoku solver made in Rust
A Rust implementation of a backtracking algorithm that solves Sudoku puzzles with randomized search, progress visualization, and colorful terminal output.
simple solver for a puzzle i used to play as a kid
🎯 A Rust + egui implementation of the classic Bulls and Cows game. Play against the bot, let the bot assist you (cheater 😏), or watch bots duel it out. Simple backtracking brain, lots of fun.
Advent of Code in Rust
Puzzle Pegs Rust version
The ultimate parameter optimizer (non-linear regression program)
Add a description, image, and links to the backtracking topic page so that developers can more easily learn about it.
To associate your repository with the backtracking topic, visit your repo's landing page and select "manage topics."