| Commit message (Collapse) | Author | Files | Lines | ||
|---|---|---|---|---|---|
| 2021-12-17 | some progress | Sebastiano Tronto | 1 | -24/+13 | |
| 2021-12-16 | Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵ | Sebastiano Tronto | 1 | -39/+141 | |
| it takes a while to generate. Plus I have done a whole lot of refactoring in random places because I cannot focus on one thing at the time. | |||||
| 2021-12-13 | Faster optimal solver. | Sebastiano Tronto | 1 | -0/+32 | |
| This is a pretty big one, but unfortunately performance only improved by about 5%. I implemented one of the main ideas of nxopt, that is switching to the inverse scramble on the fly if it gives a lower branching factor. On the one hand it makes sense that it does not have such a huge impact, since it only rarely happens that we do have a lower branching factor on inverse, but on the other hand I am quite sad that the improvement is barely noticeable :-( Maybe the problem is that I have introduced a lot of new overhead and I can improve that in the future. Or maybe I am just overlooking something stupid. | |||||
| 2021-11-28 | Added possibility of having end-of-line comments with double slash (single ↵ | Sebastiano Tronto | 1 | -2/+13 | |
| slash actually); fixed a small memory leak | |||||
| 2021-11-20 | Bugfix in reading scramble | Sebastiano Tronto | 1 | -1/+1 | |
| 2021-11-11 | Rewritten from scratch. Welocme nissy 2.0! | Sebastiano Tronto | 1 | -0/+364 | |
