37
edits
Changes
→Sudoku Brute Force Solver
== Sudoku Brute Force Solver ==
For this first assignment I decided to look into a brute force sudoku solver to see if it could benefit from parallel programming. The sudoku solver that was investigated was provided by Bryan Smith (https://github.com/bryanesmith/Sudoku-solver).
This solver goes through the given puzzle guessing numbers for any space that is not already filled and then checking to verify it doesn't break any of the sudoku rules such as horizontal, vertical and in box collisions.
As is, this solver is quick to solve a 9x9 sudoku puzzle. The time taken to solve a sudoku puzzle is under a second as seen in our time results:
0.00 0.05 0.00 1 0.00 0.00 SudokuPuzzle::SudokuPuzzle()
The profiling of this solver shows that the verifyValue function is taking up most of the execution time at 60% and which is expected as this function checks all for all of the collisions for the guessed values. This would benefit from optimizingbe the function we would want to optimize however this may not be the easiest of tasks as it seems it has some data dependencies.
=== Assignment 2 ===
=== Assignment 3 ===
