| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Small rework of optimal vs maxsols | Sebastiano Tronto | 2025-04-17 | 1 | -12/+3 |
| | | | | | | | | | | | | | | | I wanted to make the "optimal" and "maxsolutions" options mutually exclusive, but in the end I decided there is value in keeping both (e.g. for specifying a limit to the number of solutions when asking for "all" optimal"). Now optimal cannot be negative anymore, for the same reason of maxsolutions. The interface user (shell, UI) will have to take care of handling this in a way that makes sense for the user. Usually this means setting the maximum number of solutions to UINT_MAX (or a similar very high number) when the user wants "all optimal". | ||||
| * | Log solutions as they are found | Sebastiano Tronto | 2025-04-15 | 1 | -2/+13 |
| | | |||||
| * | simplified allowedmoves logic | Sebastiano Tronto | 2025-04-01 | 1 | -1/+1 |
| | | |||||
| * | Tiny bugfix in solution writing | Sebastiano Tronto | 2025-03-25 | 1 | -4/+5 |
| | | |||||
| * | Tiny fix | Sebastiano Tronto | 2025-03-25 | 1 | -4/+4 |
| | | |||||
| * | Big cleanup for appendsolution() | Sebastiano Tronto | 2025-03-24 | 1 | -5/+208 |
| | | | | | | | | | | | With this PR the appendsolution routine is extracted from the h48 solver and the new coordinate solver and made generic. This has many advantages: - less repetition (even if the two versions are different enough that *for now* it was not a big deal) - smaller h48/solve.h file, which is already a big beast - easier to test the appendsolution() routine separately | ||||
| * | Some safety with move arrays, small refactor appendchar | Sebastiano Tronto | 2025-03-22 | 1 | -0/+14 |
