| commit | 62d53ed6fd136156c72ba8ec09a36d7fbdfdcefd | [log] [tgz] |
|---|---|---|
| author | Andrea Nall <anall@andreanall.com> | Sun Nov 07 20:59:48 2021 -0600 |
| committer | Andrea Nall <anall@andreanall.com> | Sun Nov 07 20:59:48 2021 -0600 |
| tree | 58bc530fa51aa5a2dc3a54b4e9d271c8b1bd9d76 | |
| parent | f91757a023ff8c47dc25ee3c1e34b1c39c73a8e1 [diff] |
No hold violations!
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.
