This program will solve a given sudoku using backtracking.

Passing the -v option will print out the solved board once found. You can pass any number of file arguments the program will solve all of them. Only files after the -v option will print their solution.

This will solve every file in the 9x9 directory then solve puz1 in the 12x12 directory and print the solution of that puzzle. Every time the program will print the number of guesses and memory accesses. These accesses are how many squares we had to check to find the solution. The directory tells the program the size of the puzzle and the files specify the size of the blocks and puzzle.

The first line needs to be the size of the blocks in the format height x width. For example a 9x9 has 3x3 blocks therefore the first line would be 3x3. A 12x12 sudoku has 3x4 blocks, which means the blocks are 3 deep and 4 wide. 0s are used to represent an empty square. For any puzzle higher than 9x9 I use capital letters to represent the next numbers. Therefore for a 12x12 each row, column, and block contain 1-9,A,B,C. These letters are changed to integers when solving and printing the subsequent result.

When writing a new large sudoku use capital letters instead of lowercase!