aboutsummaryrefslogtreecommitdiff
path: root/src (unfollow)
Commit message (Collapse)AuthorFilesLines
2021-12-26Added scramble commandSebastiano Tronto5-31/+181
2021-12-26Added two-phase solverSebastiano Tronto7-32/+165
2021-12-26Better trans-detection system (for e.g. drfin for HTR scramble)Sebastiano Tronto3-149/+93
2021-12-25Added -O option for solve (specify number of moves within optimal)Sebastiano Tronto3-9/+24
2021-12-25Added the invert and unniss commandsSebastiano Tronto2-1/+52
2021-12-25Transform solutions early so that -v gives meaningful infoSebastiano Tronto1-11/+15
2021-12-25Changed -s (max solutions) option to -n and -n (NISS) to -NSebastiano Tronto1-2/+2
2021-12-25Better error message when option for solve is unrecognizedSebastiano Tronto1-3/+12
2021-12-24added some optimal-after-EO stepsSebastiano Tronto1-0/+63
2021-12-24Fixed bug that prevented switching depending on branch factor (leftover from ↵Sebastiano Tronto1-3/+0
previous debugging)
2021-12-24Changed default behavior of -sSebastiano Tronto1-0/+10
2021-12-24Added -c option for solveSebastiano Tronto3-1/+29
2021-12-24use nxopt31 (compressed) by default for optimal solvingSebastiano Tronto4-23/+37
2021-12-23Fixes for yesterday's commitSebastiano Tronto4-12/+31
2021-12-23Added the possibility to compress tables to 2 bits per entry.Sebastiano Tronto3-33/+108
This is done similarly to nxopt: one base value is selected and entries are memorized based on that base value. Values higher than base+3 are returned as base+3 (still a valid estimate) and values lower or equal to base require a lookup on a "fallback" table, which must give a valid estimate for the larger one (e.g. nxopt31 or khuge can fallback to drud_sym16). I have also added some info to the pruning table files: base value and distribution. Unfortunately this means that everyone who has used nissy 2.0beta has to re-generate the tables.
2021-12-22fixed typoSebastiano Tronto1-2/+1
2021-12-17some progressSebastiano Tronto7-62/+31
2021-12-16Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto14-323/+547
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-14Better output in batch modeSebastiano Tronto1-5/+14
2021-12-14removed old inverse_cube()Sebastiano Tronto1-38/+0
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 Tronto8-287/+616
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-12Faster inverse cube; makes optimal solving about 30% fasterSebastiano Tronto5-1/+241
2021-12-11Improved where_is_edgeSebastiano Tronto1-19/+13
2021-12-10Added batch modeSebastiano Tronto2-10/+18
2021-12-10Fixed segfault when passing malformed command arguments to solveSebastiano Tronto1-4/+4
2021-12-10Added gen command and modified installation instructions for tablesSebastiano Tronto3-0/+74
2021-12-09Fixed genptable for small tables and tables that do not use symmetrySebastiano Tronto1-1/+5
2021-12-09Multi-threaded pruning table generation - now it's actually fast :)Sebastiano Tronto6-37/+114
2021-12-08Just refortmatting and added one typeSebastiano Tronto3-170/+191
2021-12-08tiny cleanupSebastiano Tronto1-1/+1
2021-12-08CleanupSebastiano Tronto1-176/+0
2021-12-08Faster and nice pruning table generation. Can still be improved with ↵Sebastiano Tronto4-38/+110
multithreading.
2021-12-08Faster ptable generation (but I can make it faster)Sebastiano Tronto1-9/+45
2021-12-07Expanded on previous comment: now it contains an idea of solutionSebastiano Tronto1-0/+19
2021-12-07Just added a commentSebastiano Tronto1-0/+8
2021-12-07Little performance improvement in optimal solver - more to come!Sebastiano Tronto4-166/+274
2021-12-06Fixed typo in commentSebastiano Tronto1-1/+1
2021-12-03Removed some useless spaces (they made some sense once)Sebastiano Tronto1-9/+9
2021-12-03Some attempts at using the inverse scramble to get more info for pruning ↵Sebastiano Tronto2-15/+32
(optimal solving)
2021-12-03Moved a bunch of commented code to the bottom of the file. I still don't ↵Sebastiano Tronto1-121/+116
want to throw it away and it makes sense to keep it in this file for quick lookup.
2021-11-28Added possibility of having end-of-line comments with double slash (single ↵Sebastiano Tronto1-2/+13
slash actually); fixed a small memory leak
2021-11-26Fixing the fix (the previous commit introduced a bug when the step was not ↵Sebastiano Tronto2-3/+3
specified) + minor fixes in shell
2021-11-25Fixed a bug in freeing memory after execution of certain commands (thanks to ↵Sebastiano Tronto2-16/+23
Tommaso for reporting)
2021-11-20Added windows binarySebastiano Tronto1-5/+18
2021-11-20Bugfix in reading scrambleSebastiano Tronto2-3/+3

Generated with cgit - Back to sebastiano.tronto.net