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

Generated with cgit - Back to sebastiano.tronto.net