aboutsummaryrefslogtreecommitdiff
path: root/old/maybe-useful-steps.c (unfollow)
Commit message (Collapse)AuthorFilesLines
2023-05-01Split nissy in other repos, see README.mdSebastiano Tronto1-1111/+0
2022-09-06Symcoord version of nissy. Interesting idea, but performance areSebastiano Tronto1-419/+49
actually slower. AT THIS STAGE NISSY IS NOT USABLE.
2022-02-27Removed some unused code (khuge). Improved optimal solver performance by ↵Sebastiano Tronto1-31/+0
about 10% using raw transition tables (same for dr step).
2022-02-27Removed array-size constants for certain objects (steps, commands...)Sebastiano Tronto1-1/+3
2021-12-26Added two-phase solverSebastiano Tronto1-1/+1
2021-12-26Better trans-detection system (for e.g. drfin for HTR scramble)Sebastiano Tronto1-124/+41
2021-12-24added some optimal-after-EO stepsSebastiano Tronto1-0/+63
2021-12-24Added -c option for solveSebastiano Tronto1-0/+20
2021-12-24use nxopt31 (compressed) by default for optimal solvingSebastiano Tronto1-10/+15
2021-12-23Fixes for yesterday's commitSebastiano Tronto1-1/+4
2021-12-22fixed typoSebastiano Tronto1-2/+1
2021-12-17some progressSebastiano Tronto1-20/+10
2021-12-16Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto1-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.
2021-12-14fixed a bugSebastiano Tronto1-0/+4
2021-12-14Added light optimal solver - about 5 times slower but takes only 500Mb of RAMSebastiano Tronto1-7/+119
2021-12-14minor restylingSebastiano Tronto1-2/+3
2021-12-14little restylingSebastiano Tronto1-24/+19
2021-12-14random attemptsSebastiano Tronto1-27/+29
2021-12-13Faster optimal solver.Sebastiano Tronto1-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.
2021-12-09Multi-threaded pruning table generation - now it's actually fast :)Sebastiano Tronto1-2/+2
2021-12-07Little performance improvement in optimal solver - more to come!Sebastiano Tronto1-105/+172
2021-12-03Some attempts at using the inverse scramble to get more info for pruning ↵Sebastiano Tronto1-10/+23
(optimal solving)
2021-11-20Multithreading seems to be working now, it was easier than expected!Sebastiano Tronto1-12/+1
2021-11-15Load all necessary pruning tables for a step before the actual solving processSebastiano Tronto1-0/+142
starts. This is in preparation for multi-threaded solving (but don't get hyped, it will take time).
2021-11-12Unimportant fixedSebastiano Tronto1-1/+1
2021-11-11Rewritten from scratch. Welocme nissy 2.0!Sebastiano Tronto1-0/+941

Generated with cgit - Back to sebastiano.tronto.net