Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
Here is an C++ application. Just to give some hints about the sudoku algorithm. Make sure you change the file extension to .zip, and extract it. The algorithm is like this:
* Find the possible 9 digit number for each row according to the given values (in each row, some numbers should be given, 2-4 numbers out of 9 maybe. If there is no value given for a row, then we have 9! possibilities. If 3 value given, then we have (9-3)! = 6! possible outcome for that specific row.)
* With 9 "for" loops, check the other 2 sudoku conditions (column condition and 3-3 square condition).
The outcome that fulfills all 3 conditions is the answer.
Here is an C++ application. Just to give some hints about the sudoku algorithm. Make sure you change the file extension to .zip, and extract it. The algorithm is like this:
* Find the possible 9 digit number for each row according to the given values (in each row, some numbers should be given, 2-4 numbers out of 9 maybe. If there is no value given for a row, then we have 9! possibilities. If 3 value given, then we have (9-3)! = 6! possible outcome for that specific row.)
* With 9 "for" loops, check the other 2 sudoku conditions (column condition and 3-3 square condition).
The outcome that fulfills all 3 conditions is the answer.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
