Difference between revisions of "Algo holics"
(→Assignment 1) |
(→Assignment 1) |
||
Line 29: | Line 29: | ||
-o directs the compiler to name the executable a. | -o directs the compiler to name the executable a. | ||
+ | |||
+ | |||
+ | If we run the sample-puzzle-1 (level- easy) file the output will be: | ||
+ | |||
+ | Input 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 | ||
=== Assignment 2 === | === Assignment 2 === | ||
=== Assignment 3 === | === Assignment 3 === |
Revision as of 03:03, 22 February 2019
GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary
Contents
Project Name Goes here
Team Members
- Sukhbeer Dhillon, Responsibilities...
- Gurpreet Singh, Some other responsibility
- Edgar Giang, Some other other responsibility
- 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.
Compiling the program
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 the output will be:
Input 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