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.

This app written in vanilla TypeScript solves any given sudoku using backtracking algorithm.

Sudoku

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 Solver is a user-friendly application with UI that utilizes Backtracking and Genetic algorithm to solve puzzles of various size and difficulties

Sudoku Puzzle using backtracking algorithm

Puzzle Pegs TypeScript version

visualization of a depth-first-search sudoku solve

N-Queens problem solution with units testing

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

A sudoku solver written in typescript using backtracking.

Collection of algorithm-based projects to help visualize concepts like bactracking, sorting, and FIFO.

A TypeScript library for partitioning T = N × M items (each with a positive capacity) into exactly N groups of exactly M items each, minimizing the maximum difference (delta) between group sums and, secondarily, the standard deviation.

two-dimensional maze generation and solving

Sudoku solving app.

🧠 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

Solves Sudoku puzzles fast by eliminating potential values in cells. If that fails, it completes the puzzle using backtracking.