Sudoku Solver PDF
Sudoku Solver PDF
Sudoku Solver PDF
SUDOKU SOLVER
• Our job is to place a number into every empty box so that each row
across and each colomn Down and each small 9*9-box square within the
large square (there are 9*9 of these) will contain each number from 1
through 9*9.Remember that no number may appear more than once in
any colomn down or within any small 9*9-box respectively.
The number
T will be filled with the help of pattern matching…..
There also a big challenge for us to calculate the grid and builds up logic.
Work Description
Concept
The main concept of our project is solving Sudoku by our code.Our code can
solve Sudoku of 9 * 9.Sudoku is a popular game and our
code make this game more easy and interesting.
Idea
We got the idea if making the code from the famous Sudoku game.
It shows the solve of the Sudoku problem.
Logic
Sudoku is a popular game.We know the basic rules of Sudoku.Logic of
our code make by using possibility , combination , permutation.Logic
calculate row and colomn possible solution with grid.Logic use different
combination of grid for different dimension of Sudoku.
Work Description
Logic Build up
The logic of our code divide the row and colomn by dimension . then logic use
sorting to find the possible solution . Logic remove some possible solution
because these solutions break the rules of Sudoku . Then logic give the
solution of that Sudoku . Logic use different calculation for different grid
Sudoku because row and colomn are different . Then main process of logic is
same.
Partition
Implement
We write our code according to our idea , algorithm , flowchart &
logic what we planning for and adding some function to add the key
feature to increasing interest on our software and also make the
boring game interesting to all…
Table
WEEKS WORKS
The objectives of the game is to fill all the blank squares in a game with the
correct numbers.There are three very simple way to follow. In a 9 by 9
square Sudoku game:
1)Every row of 9 numbers must be include all digits 1 through 9 in any order .
2)Every colomn of 9 numbers must include all digits 1 through 9 in any order.
.
Algorithm
STEP 1:Start.
STEP 2:Enter how many times you want to play.
STEP 3:Choose gameplay mood.
STEP 4:Enter matrix or Sudoku problem.
STEP 5:Press 0 to continue or 1 to update.
STEP 6:If 0 then :Continue.
Else:update row , colomn , replacing element value and 0 to exit
STEP 7:Checking for error.
STEP 8:If error then: update row , colomn , replacing element value and 0 to exit
Else:continue.
STEP 9:Print the absolute Sudoku problem.
STEP 10:Processed by checking , pattern matching and elimination.
STEP 11:Checking for error.
STEP 12:IF error then:
Print ”no solution”
Else:Print solution Sudoku.
STEP 13: Stop.
Conclusion
• The algorithm seems to be a useful method to solve any Sudoku puzzles and it
can guarantee to find at least one solution . However , this is not efficient
because the level of difficulties is irrelevant to the algorithm.In other words ,
the algorithm does not adopt intelligent strategies to solve the puzzles. This
algorithm checks all possible solutions to the puzzle until a valid solution is
found which is a time consuming procedure resulting an inefficient solver . As
it has already stated the main advantage og using the algorithm is the ability to
solve any puzzle and a solution is certainly guaranteed…