| commit | c51563dea6c67d10c26978a6ace0aeed5c8d019c | [log] [tgz] |
|---|---|---|
| author | Andrea Nall <anall@andreanall.com> | Mon Oct 11 23:21:04 2021 -0500 |
| committer | Andrea Nall <anall@andreanall.com> | Mon Oct 11 23:21:04 2021 -0500 |
| tree | bb365b6ae136133899b76d0b2ef689658e60448c | |
| parent | 22cefa00031955835263c229f80f398d97dca432 [diff] |
add mpw-3-a branch to sudoku_accelerator, update subrepo
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.