Sudoku
Description
Given a text file representation of a Sudoku board, this project can solve it, assuming a solution exists. This solution is implemented by recursively trying reasonable numbers in each square until the path we took comes to a dead end, or all squares become filled. If we run into a dead end we jump back to an earlier square and guess the next resonable number. Continue this process until all squares have been filled.
Main Takeaways
  • Recursion
  • Reading text files of an expectable format