A sudoku solver written in typescript using backtracking.
-
Updated
Oct 30, 2018 - TypeScript
A sudoku solver written in typescript using backtracking.
XMEN DNA Solver
Puzzle Pegs TypeScript version
Sudoku Puzzle using backtracking algorithm
Solves Sudoku puzzles fast by eliminating potential values in cells. If that fails, it completes the puzzle using backtracking.
🧠 A web game to play sudoku built in Typescript.
Collection of algorithm-based projects to help visualize concepts like bactracking, sorting, and FIFO.
two-dimensional maze generation and solving
visualization of a depth-first-search sudoku solve
A simple and powerful sudoku solver that supports multiple game patterns up to 16x16.
📈 Sudoku solver implemented using a backtracking algorithm
A set of solved problems on dynamic programing 🎈
Sudoku Solver is a user-friendly application with UI that utilizes Backtracking and Genetic algorithm to solve puzzles of various size and difficulties
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
Visualisation for Backtracking Algorithms
Learning how to generate a valid Sudoku board
💫 A Flow-Free-Solver web app employs backtracking with A* and BFS to solve Flow Free puzzles.
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."