flat assembler
Message board for the users of flat assembler.
Index
> Projects and Ideas > fast sudoku solver in windows |
Author |
|
revolution 11 Jul 2009, 09:43
There is already a GUI with solver for sudoku posted to this board a few years ago. If you can't find it with the site search then I think I have the file somewhere in my backup.
BTW: Sudoku is really easy to solve with the CPU in less than a milli-second. The speed is not really an issue unless you are solving thousands of grids each second? |
|||
11 Jul 2009, 09:43 |
|
revolution 11 Jul 2009, 10:22
|
|||
11 Jul 2009, 10:22 |
|
tthsqe 11 Jul 2009, 18:03
I'm talking on the order of tens of microseconds or less for normal sudokus. It's build for speed. Some sudokus are not so easy, though. Take this one:
Code: .......39 .....1..5 ..3.5.8.. ..8.9...6 .7...2... 1..4..... ..9.8..5. .2....6.. 4..7..... Brian Turner has a C program that solves it in about 800 microseconds, and I am wondering what kind of speed up one can get in assembly using slightly different algorithms/data structures. |
|||
11 Jul 2009, 18:03 |
|
tthsqe 11 Jul 2009, 18:07
by normal sudokus I mean the ones humans can be expected to solve
|
|||
11 Jul 2009, 18:07 |
|
tthsqe 11 Jul 2009, 18:10
Also, the faster one can solve, the faster one can generate quality sudoku puzzles. The solver in the link above seems to be very slow.
|
|||
11 Jul 2009, 18:10 |
|
revolution 11 Jul 2009, 23:54
tthsqe wrote: Also, the faster one can solve, the faster one can generate quality sudoku puzzles. The solver in the link above seems to be very slow. |
|||
11 Jul 2009, 23:54 |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2024, Tomasz Grysztar. Also on GitHub, YouTube.
Website powered by rwasa.