| commit | 55c2ab047edd73d4576a559783695a4facfa0de7 | [log] [tgz] |
|---|---|---|
| author | Andrea Nall <anall@andreanall.com> | Tue Oct 12 20:16:51 2021 -0500 |
| committer | Andrea Nall <anall@andreanall.com> | Tue Oct 12 20:16:51 2021 -0500 |
| tree | c5db126bc588620112d9fc0b9ad9ac6ef5585f63 | |
| parent | fe9daab236e522b393049999601af01d8d748ce6 [diff] |
remove lingering 'user_proj_example' stuff
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.