AT-CS10 · Data structures
Sudoku Solver Using Backtracking
Enter any Sudoku and watch it being solved step by step.
- Suits
- Sem 3–4
- Branches
- CSE, ISE, AIML
- Type
- Software
How it works
You enter the puzzle and the program first checks that it is valid. It then goes to the first empty cell and tries the numbers 1 to 9. If a number does not break any rule, it moves to the next cell. When it gets stuck, it goes back and changes an earlier number. This is backtracking, and the animation shows each step until the grid is complete.
What it does
- Backtracking algorithm
- Step animation
- Puzzle check
Built with
Python or C++
What you get
- Working software with full source code
- Steps to install and run it on your laptop
- Rough report and explanation of the working
- Live demo on video call before the final payment
Good to know
- Features are as listed here. Anything extra is quoted separately.
- Runs on a normal laptop unless we tell you otherwise.
- Full reports and PPTs are not included.
Similar projects
- AT-CS11Shortest Path Finder (Dijkstra)Pick two points on a map and see the shortest route found by Dijkstra's algorithm.
- AT-CS12Text Auto-Complete Using TrieSuggests words as you type, using a trie built from a dictionary.
- AT-CS13File Compression Tool (Huffman Coding)Compresses and restores text files and shows the space saved.
- AT-CS01Student Attendance Management SystemTeachers mark attendance online and students see their percentage subject by subject.