This is a Sudoku solver implemented in C++, solving Sudokus using a dynamic programming depth first search. Input files are assumed to be files containing nine lines of nine integers each, where each integer represents a Sudoku cell. Filled in cells are represented by numbers 1 through 9 while empty cells are represented by the number 0.