# Project Name Goes here

## Team Members

1. Sukhbeer Dhillon, Responsibilities...
2. Gurpreet Singh, Some other responsibility
3. Edgar Giang, Some other other responsibility
4. Email All

## Progress

### Assignment 1

##### Sudoku Solver

Is it a program that solves Sudoku puzzles(9X9) using Bruteforce algorithm. Either the user can pass a Sudoku files as an input or enter the values manually. Moreover, the file or the manual entry should have strictly 9 rows and 9 columns in them. Lastly, all the cells should be separated by a space and the cells that needs to be solved should have 0 in them as their value.

The original source code can be found at Link

##### LOGIC

In this program the Bruteforce algorithm first put 1 in the first cell and then check if it is violating any rules. If yes, then it increment the value to 2 and check again (The value can vary from 1-9) until it finds the appropriate value. After finding a suitable value for the first cell, it moves to the second cell and put 1 in there and again check again if it violating any rules. If it is discovers that 1 is not allowed in that cell, then the algorithm will increment it to 2 and check again and if no even a single value from the range of 0-9 satisfies the cell, then the algorithm will iterate back to the previous cell and increment the value and try the whole process again. By following the same logic it will solve the whole puzzle.

##### Compiling the program

Enter the following commands:

g++ -std=c++0x -pg solver.cpp checks.cpp checksolution.cpp -o a
a fileName

-pg directs the compiler to include the executable code required for profiling.

-o directs the compiler to name the executable a.

If we run the sample-puzzle-1 (level- easy) file, which has the following text inside it:

0 6 0 0 0 0 9 7 2
0 5 0 0 0 2 0 0 3
0 7 0 3 9 0 5 0 0
2 0 0 0 0 5 4 0 8
0 0 0 0 0 0 0 0 0
3 0 1 8 0 0 0 0 6
0 0 4 0 2 3 0 8 0
7 0 0 9 0 0 0 2 0
9 2 5 0 0 0 0 4 0

The output will be:

1 6 3 4 5 8 9 7 2
4 5 9 7 1 2 8 6 3
8 7 2 3 9 6 5 1 4
2 9 7 1 6 5 4 3 8
5 8 6 2 3 4 1 9 7
3 4 1 8 7 9 2 5 6
6 1 4 5 2 3 7 8 9
7 3 8 9 4 1 6 2 5
9 2 5 6 8 7 3 4 1

##### Analysis

To analyze the flat profile, enter the following command:

gprof -p -b a> a.flt

-p directs the profiler (gprof) to output a flat profile.

-b directs the profiler to omit detailed explanations of the column headings from the output.

Flat profile:
Each sample counts as 0.01 seconds.
no time accumulated
%   cumulative   self              self     total
time   seconds   seconds    calls  Ts/call  Ts/call  name
0.00      0.00     0.00     4539     0.00     0.00  checkRow(int, int)
0.00      0.00     0.00     1620     0.00     0.00  checkColumn(int, int)
0.00      0.00     0.00     1120     0.00     0.00  placeNum(int, int)
0.00      0.00     0.00      698     0.00     0.00  checkSquare(int, int, int)
0.00      0.00     0.00      476     0.00     0.00  goBack(int&, int&)
0.00      0.00     0.00        2     0.00     0.00  print(int (*) [9])
0.00      0.00     0.00        1     0.00     0.00  _GLOBAL__sub_I_sudoku
0.00      0.00     0.00        1     0.00     0.00  _GLOBAL__sub_I_temp
0.00      0.00     0.00        1     0.00     0.00  solveSudoku()
0.00      0.00     0.00        1     0.00     0.00  storePositions()
0.00      0.00     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
0.00      0.00     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)

From the above Flat profile we can see that the program took no time in finding the solution. Therefore, to get better understanding of the program let's try a harder Sudoku puzzle.

If we run the sample-puzzle-2-hard (Level- hard) file, which has the following text inside it:

0 0 0 0 0 0 0 0 0
0 0 0 0 0 3 0 8 5
0 0 1 0 2 0 0 0 0
0 0 0 5 0 7 0 0 0
0 0 4 0 0 0 1 0 0
0 9 0 0 0 0 0 0 0
5 0 0 0 0 0 0 7 3
0 0 2 0 1 0 0 0 0
0 0 0 0 4 0 0 0 9

The output will be: