| commit | f91757a023ff8c47dc25ee3c1e34b1c39c73a8e1 | [log] [tgz] |
|---|---|---|
| author | Andrea Nall <anall@andreanall.com> | Sun Nov 07 20:43:49 2021 -0600 |
| committer | Andrea Nall <anall@andreanall.com> | Sun Nov 07 20:43:49 2021 -0600 |
| tree | dd95bfe94573dcb8ece06c1cb285b4e31786c509 | |
| parent | f462beebe068ec89f19af9b2b85bdee0691f1d1b [diff] |
remove useless dv tests
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.
