A simple, interactive Sudoku solver
built using vanilla JavaScript. It allows users to input their own Sudoku puzzle, validates entries, and solves the puzzle using a backtracking algorithm.
Sudoku is a logic-based number-placement puzzle. The modern version was popularized in Japan in the 1980s (the name “Sudoku” is short for a phrase meaning “single number”) and French newspapers featured similar puzzles in the 19th century, and the modern form of the puzzle first appeared in 1979 puzzle books by Dell Magazines under the name Number Place. The classic 9x9 Sudoku board requires each row, column, and 3x3 sub-grid to contain all digits from 1 to 9 exactly once.





- STEP-1:Select the tile you want to place the number.
- STEP-2:Select the number you want to choose/also you can delete the selected cell.
- similarly populate the grid as per your problem.
- Backtracking algorithm to solve the given sudoko
- Clear and reset button.
clear buttons
clears the selected tilereset button
clears the board.
- Validates error when it violates sudoko rules.
- wanna revise backtracking
- warming up hcj and python
- ofc for fun
- Inspired from leetcode
37. Sudoku Solver
,I love problem solving.
.
├── PROTOTYPE
│ ├── JS
│ │ ├── data.json
│ │ └── solver.js
│ └── PYTHON
│ ├── solver.ipynb
│ └── sudoko.csv
├── index.html
├── script.js
└── style.css
PROTOTYPE
directory hasJS,Py
in which I have wrote the base backtracking algorithm and tested with json,csvscript.js
contains the main logic forindx.html
handling.
Sudoku is played on a 9×9 grid, divided into nine 3×3 subgrids (also called "boxes" or "regions"). The objective is to fill the grid so that:
- Each row must contain all digits from 1 to 9, with no repetition.
- Each column must also contain all digits from 1 to 9, with no repetition.
- Each 3×3 subgrid must contain all digits from 1 to 9, with no repetition.