commit | 72e99de2226e4b04357d3cf907ced9f5aa953372 | [log] [tgz] |
---|---|---|
author | Andrea Nall <anall@andreanall.com> | Tue Oct 12 20:17:34 2021 -0500 |
committer | Andrea Nall <anall@andreanall.com> | Tue Oct 12 20:19:51 2021 -0500 |
tree | 385ad97a039a953ca8dc5fb0160ddbc7f1af81ff | |
parent | 55c2ab047edd73d4576a559783695a4facfa0de7 [diff] |
Final changes, harden * Add one more layer of wrapper, to make some extra connections * Harden project * Update readme/info.yaml * final test polish
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.