aboutsummaryrefslogtreecommitdiff
path: root/src/solve.c (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Added two-phase solverSebastiano Tronto2021-12-261-0/+51
|
* Better trans-detection system (for e.g. drfin for HTR scramble)Sebastiano Tronto2021-12-261-24/+49
|
* Added -O option for solve (specify number of moves within optimal)Sebastiano Tronto2021-12-251-3/+6
|
* Transform solutions early so that -v gives meaningful infoSebastiano Tronto2021-12-251-11/+15
|
* Fixed bug that prevented switching depending on branch factor (leftover from ↵Sebastiano Tronto2021-12-241-3/+0
| | | | previous debugging)
* some progressSebastiano Tronto2021-12-171-2/+3
|
* Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto2021-12-161-37/+43
| | | | | | | 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-120/+194
| | | | | | | | | | | 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-1/+1
|
* Just refortmatting and added one typeSebastiano Tronto2021-12-081-3/+3
|
* Little performance improvement in optimal solver - more to come!Sebastiano Tronto2021-12-071-52/+73
|
* Multithreading seems to be working now, it was easier than expected!Sebastiano Tronto2021-11-201-23/+170
|
* Load all necessary pruning tables for a step before the actual solving processSebastiano Tronto2021-11-151-20/+9
| | | | | starts. This is in preparation for multi-threaded solving (but don't get hyped, it will take time).
* Rewritten from scratch. Welocme nissy 2.0!Sebastiano Tronto2021-11-111-0/+173

Generated with cgit - Back to sebastiano.tronto.net