sudoko solver

This project is a Sudoku Game Solver that automatically fills in a partially completed Sudoku grid by applying logical constraints and backtracking techniques. The goal is to complete the 9×9 grid so that every row, column, and 3×3 sub-grid contains all digits from 1 to 9 without repetition.

The solver uses a constraint-based backtracking algorithm, which tries possible numbers in empty cells and recursively checks whether the current placement leads to a valid solution. If a conflict is found, the algorithm backtracks and tries another value until the puzzle is solved.

A key feature of the system is a Validation Button, which allows users to verify whether the current grid state is valid according to Sudoku rules. This helps detect incorrect entries early before attempting to solve the puzzle.

Overall, the project demonstrates the use of search and constraint satisfaction techniques in artificial intelligence, providing both an interactive interface and an efficient solving mechanism.