aboutsummaryrefslogtreecommitdiff
path: root/src/steps.c (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Better trans-detection system (for e.g. drfin for HTR scramble)Sebastiano Tronto2021-12-261-124/+41
|
* added some optimal-after-EO stepsSebastiano Tronto2021-12-241-0/+63
|
* Added -c option for solveSebastiano Tronto2021-12-241-0/+20
|
* use nxopt31 (compressed) by default for optimal solvingSebastiano Tronto2021-12-241-10/+15
|
* Fixes for yesterday's commitSebastiano Tronto2021-12-231-1/+4
|
* fixed typoSebastiano Tronto2021-12-221-2/+1
|
* some progressSebastiano Tronto2021-12-171-20/+10
|
* Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto2021-12-161-105/+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.
* fixed a bugSebastiano Tronto2021-12-141-0/+4
|
* Added light optimal solver - about 5 times slower but takes only 500Mb of RAMSebastiano Tronto2021-12-141-7/+119
|
* minor restylingSebastiano Tronto2021-12-141-2/+3
|
* little restylingSebastiano Tronto2021-12-141-24/+19
|
* random attemptsSebastiano Tronto2021-12-141-27/+29
|
* Faster optimal solver.Sebastiano Tronto2021-12-131-144/+355
| | | | | | | | | | | 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.
* Multi-threaded pruning table generation - now it's actually fast :)Sebastiano Tronto2021-12-091-2/+2
|
* Little performance improvement in optimal solver - more to come!Sebastiano Tronto2021-12-071-105/+172
|
* Some attempts at using the inverse scramble to get more info for pruning ↵Sebastiano Tronto2021-12-031-10/+23
| | | | (optimal solving)
* Multithreading seems to be working now, it was easier than expected!Sebastiano Tronto2021-11-201-12/+1
|
* Load all necessary pruning tables for a step before the actual solving processSebastiano Tronto2021-11-151-0/+142
| | | | | starts. This is in preparation for multi-threaded solving (but don't get hyped, it will take time).
* Unimportant fixedSebastiano Tronto2021-11-121-1/+1
|
* Rewritten from scratch. Welocme nissy 2.0!Sebastiano Tronto2021-11-111-0/+941

Generated with cgit - Back to sebastiano.tronto.net