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
Sudoku solver implementations in rust.
A Rust application that generates class schedules using a backtracking algorithm.
Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.
A simple and fast implementation of backtrack solving of Sudokus
This project contains solutions for solving the max clique problem.
Sudoku solver using backtracking in Rust
Puzzle Pegs Rust version
The ultimate parameter optimizer (non-linear regression program)
simple solver for a puzzle i used to play as a kid
Advent of Code in Rust
Completed Synacor Challenge
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.
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."