//////////////////////////////////////////////////// /// Sudoku Puzzle Solver /// -------------------- /// /// Made By - Kinshuk Vasisht /// Version - 1.0 /// Features - Gets the Solution to a /// Solvable Sudoku Puzzle of /// any Difficulty... /// Requires the Input of the /// Sudoku Puzzle, with /// representing blanks... /// Overloads - None. /// Functions - get(), print(), Column(), /// SearchLocation(), //Row(), /// MiniGrid(), Safe_Check() /// SudokuSolver() /// [Solves Sudoku using Backtracking]... /// Main Data Type - Int. /// Templates - None. /// Macros - None. /// Headers - #include (1) /// No. of Lines - 90 (No Extras) /// Contributions - None. /// //////////////////////////////////////////////////// /* All The user Needs to do is Input a Sudoku Puzzle with a Valid Solution... Yes, that will take a lot of time as it is a 9*9 Matrix... Put 0's in the Blanks... I have also left some sample Sudoku Puzzles in the Comments, for use... Have Fun!!! - Kinshuk Vasisht NOTE -: This is a program using backtracking to solve the Sudoku Puzzles. Please do not use any Sudoku Puzzle made specifically to work against backtracking as that will take a lot of time to solve... Eg - 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 8 5 0 0 1 0 2 0 0 0 0 0 0 0 5 0 7 0 0 0 0 0 4 0 0 0 1 0 0 0 9 0 0 0 0 0 0 0 5 0 0 0 0 0 0 7 3 0 0 2 0 1 0 0 0 0 0 0 0 0 4 0 0 0 9 Took 138.974 secs on C::B in Win10, i5 CPU, 6GB DDR4 RAM... */ #include using namespace std; /*void get(int x[9][9]) { for(int i=0;i<9;i++) for(int j=0;j<9;j++) cin>>x[i][j]; } */ void print(int x[9][9]) { for(int i=0;i<9;i++) { for(int j=0;j<9;j++) cout<