aboutsummaryrefslogtreecommitdiff
path: root/src (unfollow)
Commit message (Collapse)AuthorFilesLines
2022-06-01parallelized genptable_fixnastySebastiano Tronto3-21/+72
2022-06-01Save more stuff to fileSebastiano Tronto2-16/+132
2022-06-01Fixed bug with nxoptSebastiano Tronto2-1/+2
2022-06-01Fixed some bugs - still more testing neededSebastiano Tronto4-82/+55
2022-05-31Big changes to coordinate system: remove "anti-index" in favor of a more ↵Sebastiano Tronto8-437/+572
kociemba-like move function for each coordinate. This should speedup the table generation step. WARNING: nissy might not be 100% functional at this stage, TESTING needed!
2022-03-15Prepare for big changes in coordinatesSebastiano Tronto6-31/+50
2022-03-12Added freemem commandSebastiano Tronto6-18/+49
2022-03-07Set up for adding freemem commandSebastiano Tronto2-0/+24
2022-03-03Added messages about generating pruning tablesSebastiano Tronto4-2/+50
2022-03-02Added dr and htr scramblesSebastiano Tronto3-24/+57
2022-02-27Removed some unused code (khuge). Improved optimal solver performance by ↵Sebastiano Tronto7-126/+28
about 10% using raw transition tables (same for dr step).
2022-02-27Removed array-size constants for certain objects (steps, commands...)Sebastiano Tronto7-65/+20
2022-02-27Moved random_cube() from cube.c to commands.c and fixed a bug in corners ↵Sebastiano Tronto5-43/+67
only and edges only scrambles. Added fmc scrambles (with R'U'F). Updated manpage for scramble and cleanup.
2022-02-27Changed unniss() to return an Alg*. Addedd inplace() to run a function on an ↵Sebastiano Tronto4-14/+24
alg in place.
2022-02-25Removed possible cancellable moves from 2phase solverSebastiano Tronto1-2/+5
2022-02-25Added cleanup commandSebastiano Tronto3-0/+145
2022-02-21Fixed bug in using nissSebastiano Tronto1-1/+1
2022-02-13Fixed bug in reading scrambles with unmatched parenthesesSebastiano Tronto2-14/+12
2022-01-15Added one adhoc test (cornerhtr from CO)Sebastiano Tronto3-23/+28
2021-12-27Added option -i to accept scramble(s) from stdin, very useful for batch modeSebastiano Tronto4-16/+37
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

Generated with cgit - Back to sebastiano.tronto.net