Recently, I decided to write a Sudoku solver program. It's relatively easy to determine if a puzzle is solved correctly, but it is very hard to try and generate a solution. I decided to just generate every possible combination until a solution was found. What I didn't account for was the length of time required to generate and test 9^81 puzzles. Next step is to figure out how to build a solver that will stop generating a solution when the solution becomes impossible.
Kudos to you man. That is pretty awesome. I am a computer programmer myself so this post caught my eye right away. I am actually having a similar problem myself on a program that I am working on. I am trying to create a program that will generate a schedule for my work this summer (there are a lot of different jobs and times involved so scheduling 37 people can be time consuming) but at this point I haven't figured out how to stop making a schedule if in the end it won't be a full one. Let me know if you make any progress!
ReplyDeleteThat's cool that you were able to create a program that can solve for so many different solutions. It could help the people in our group out if they ever gets stuck on a puzzle since all of our group likes to do Sudoku puzzles. Good luck trying to figure out how to build a solver that will stop generating a solution when it is impossible.
ReplyDelete