|author||Jeff DiCorpo <email@example.com>||Wed Dec 29 02:59:05 2021 -0800|
|committer||Jeff DiCorpo <firstname.lastname@example.org>||Wed Dec 29 02:59:05 2021 -0800|
final gds oasis
This project contains a two sudoku accelerator modules on a wishbone bus.
Each solver module is capable of performing both a simple ‘only candidate’ method, as well as finding row-only ‘naked singles’.
A single ‘only candidate’ pass on the whole puzzle completes in 23 cycles, and a ‘naked singles’ pass completes in 108 cycles.
The solver will exit early during a run if the puzzle becomes solved, or if a single cell ends up with no remaining valid values (do note that this doesn't mean the solver can detect all illegal puzzles).
This design also contains a modified FIFO-enabled version of simpleuart (from caravel) to make external communication easier.