Solve hard constraints easily with Rust.
-
Updated
Jul 17, 2022 - Rust
Solve hard constraints easily with Rust.
A GAP package for backtrack search in permutation groups with graphs
A Rust application that generates class schedules using a backtracking algorithm.
Sudoku solver implementations in rust.
Fast Sudoku Solver that leverages bitmasks and the MRV heuristic to crack over 450.000 grids/second
A simple and fast implementation of backtrack solving of Sudokus
This project contains solutions for solving the max clique problem.
Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.
Implementation Of The 🐴 Knight's Tour 🐴 Problem in Rust
Sudoku solver using backtracking in Rust
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.
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.
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."