| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Only store the most constrained move | Robby Zambito | 2025-05-19 |
| | | |||
| * | Try saving only the minimum | Robby Zambito | 2025-05-19 |
| | | | | | still only half as fast as saving the list? | ||
| * | Use list of possible moves, sort and get the first | Robby Zambito | 2025-05-19 |
| | | |||
| * | Just storing min value | Robby Zambito | 2025-05-19 |
| | | |||
| * | Basic solver that uses simd for simple puzzles | Robby Zambito | 2025-05-19 |
| | | | | | this assumes there is at least one cell with only one valid answer at any given step. | ||
| * | initial commit | Robby Zambito | 2025-05-13 |
