commit | f462beebe068ec89f19af9b2b85bdee0691f1d1b | [log] [tgz] |
---|---|---|
author | Andrea Nall <anall@andreanall.com> | Mon Nov 01 15:23:02 2021 -0500 |
committer | Andrea Nall <anall@andreanall.com> | Mon Nov 01 18:54:04 2021 -0500 |
tree | bc4c6f3417317bdc043fe06d198d3f84fa634d99 | |
parent | 72e99de2226e4b04357d3cf907ced9f5aa953372 [diff] |
Reharden with new OpenLane tools due to hold issues Not 100% clear, but better: -0.11 slack (VIOLATED) -0.11 slack (VIOLATED) -0.10 slack (VIOLATED) -0.10 slack (VIOLATED) -0.09 slack (VIOLATED) Will still attempt to get those to go away
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.