An algorithm to solve Soduko puzzles. This program uses a Brute Force Search with Backtracking to solve the Soduko.
https://en.wikipedia.org/wiki/Sudoku_solving_algorithms
Requires C++ 11
The Brute Force Search algorithm visits the empty cells in some order, filling in digits sequentially, or backtracking when the number is found to be not valid. The program would solve a puzzle by placing the digit "1" in the first cell and checking if it is allowed to be there. If there are no violations (checking row, column, and box constraints) then the algorithm advances to the next cell, and places a "1" in that cell. When checking for violations, if it is discovered that the "1" is not allowed, the value is advanced to "2". If a cell is discovered where none of the 9 digits is allowed, then the algorithm leaves that cell blank and moves back to the previous cell; this is known as Backtracking. Backtracking is a depth-first search (in contrast to a breadth-first search), because it will completely explore one branch to a possible solution before moving to another branch.The value in that cell is then incremented by one. This is repeated until the allowed value in the last (81st) cell is discovered.