A simple and powerful sudoku solver that supports multiple game patterns up to 16x16.
- Updated
Feb 20, 2023 - TypeScript
A simple and powerful sudoku solver that supports multiple game patterns up to 16x16.
A set of solved problems on dynamic programing 🎈
XMEN DNA Solver
🧠 A web game to play sudoku built in Typescript.
💫 A Flow-Free-Solver web app employs backtracking with A* and BFS to solve Flow Free puzzles.
📈 Sudoku solver implemented using a backtracking algorithm
Visualisation for Backtracking Algorithms
Solves Sudoku puzzles fast by eliminating potential values in cells. If that fails, it completes the puzzle using backtracking.
Learning how to generate a valid Sudoku board
This app written in vanilla TypeScript solves any given sudoku using backtracking algorithm.
A Sudoku game with an AI agent that generates puzzles, solves them, and verifies their validity using constraint satisfaction algorithms. The AI uses backtracking and heuristics for efficient solving. It also offers a web interface for users to interact with the puzzle.
A classic Sudoku game built with simplicity and logic at its core. This project features a clean interface and a powerful backtracking algorithm to solve even the toughest puzzles. Whether you're playing for fun or exploring how algorithms tackle constraint problems, this is a great place to start.
Sudoku Puzzle using backtracking algorithm
Sudoku Solver is a user-friendly application with UI that utilizes Backtracking and Genetic algorithm to solve puzzles of various size and difficulties
visualization of a depth-first-search sudoku solve
Puzzle Pegs TypeScript version
a simple website where you can play sudoku games according to levels of hardness and find solutions to any sudoku board you provide as well
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."