aboutsummaryrefslogtreecommitdiff
path: root/src/alg.h (unfollow)
Commit message (Collapse)AuthorFilesLines
2023-05-01Split nissy in other repos, see README.mdSebastiano Tronto1-35/+0
2023-03-05I made a mess, but it works. Still need to implement new optimal solver.Sebastiano Tronto1-73/+3
After that, a big redesign is due.
2023-02-10Added (just a few) tests for alg and added fields to alg structSebastiano Tronto1-5/+5
2022-09-06Symcoord version of nissy. Interesting idea, but performance areSebastiano Tronto1-7/+69
actually slower. AT THIS STAGE NISSY IS NOT USABLE.
2022-02-27Changed unniss() to return an Alg*. Addedd inplace() to run a function on an ↵Sebastiano Tronto1-1/+2
alg in place.
2022-01-15Added one adhoc test (cornerhtr from CO)Sebastiano Tronto1-1/+2
2021-12-26Added two-phase solverSebastiano Tronto1-0/+1
2021-12-16Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto1-6/+9
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-13Faster optimal solver.Sebastiano Tronto1-0/+2
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-11Rewritten from scratch. Welocme nissy 2.0!Sebastiano Tronto1-0/+35

Generated with cgit - Back to sebastiano.tronto.net