aboutsummaryrefslogtreecommitdiff
path: root/src (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Removed some unused code (khuge). Improved optimal solver performance by ↵Sebastiano Tronto2022-02-277-126/+28
| | | | about 10% using raw transition tables (same for dr step).
* Removed array-size constants for certain objects (steps, commands...)Sebastiano Tronto2022-02-277-65/+20
|
* Moved random_cube() from cube.c to commands.c and fixed a bug in corners ↵Sebastiano Tronto2022-02-275-43/+67
| | | | | | only and edges only scrambles. Added fmc scrambles (with R'U'F). Updated manpage for scramble and cleanup.
* Changed unniss() to return an Alg*. Addedd inplace() to run a function on an ↵Sebastiano Tronto2022-02-274-14/+24
| | | | alg in place.
* Removed possible cancellable moves from 2phase solverSebastiano Tronto2022-02-251-2/+5
|
* Added cleanup commandSebastiano Tronto2022-02-253-0/+145
|
* Fixed bug in using nissSebastiano Tronto2022-02-211-1/+1
|
* Fixed bug in reading scrambles with unmatched parenthesesSebastiano Tronto2022-02-132-14/+12
|
* Added one adhoc test (cornerhtr from CO)Sebastiano Tronto2022-01-153-23/+28
|
* Added option -i to accept scramble(s) from stdin, very useful for batch modeSebastiano Tronto2021-12-274-16/+37
|
* Added scramble commandSebastiano Tronto2021-12-265-31/+181
|
* Added two-phase solverSebastiano Tronto2021-12-267-32/+165
|
* Better trans-detection system (for e.g. drfin for HTR scramble)Sebastiano Tronto2021-12-263-149/+93
|
* Added -O option for solve (specify number of moves within optimal)Sebastiano Tronto2021-12-253-9/+24
|
* Added the invert and unniss commandsSebastiano Tronto2021-12-252-1/+52
|
* Transform solutions early so that -v gives meaningful infoSebastiano Tronto2021-12-251-11/+15
|
* Changed -s (max solutions) option to -n and -n (NISS) to -NSebastiano Tronto2021-12-251-2/+2
|
* Better error message when option for solve is unrecognizedSebastiano Tronto2021-12-251-3/+12
|
* added some optimal-after-EO stepsSebastiano Tronto2021-12-241-0/+63
|
* Fixed bug that prevented switching depending on branch factor (leftover from ↵Sebastiano Tronto2021-12-241-3/+0
| | | | previous debugging)
* Changed default behavior of -sSebastiano Tronto2021-12-241-0/+10
|
* Added -c option for solveSebastiano Tronto2021-12-243-1/+29
|
* use nxopt31 (compressed) by default for optimal solvingSebastiano Tronto2021-12-244-23/+37
|
* Fixes for yesterday's commitSebastiano Tronto2021-12-234-12/+31
|
* Added the possibility to compress tables to 2 bits per entry.Sebastiano Tronto2021-12-233-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.
* fixed typoSebastiano Tronto2021-12-221-2/+1
|
* some progressSebastiano Tronto2021-12-177-62/+31
|
* Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto2021-12-1614-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.
* 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
|
* Better output in batch modeSebastiano Tronto2021-12-141-5/+14
|
* removed old inverse_cube()Sebastiano Tronto2021-12-141-38/+0
|
* 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-138-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.
* Faster inverse cube; makes optimal solving about 30% fasterSebastiano Tronto2021-12-125-1/+241
|
* Improved where_is_edgeSebastiano Tronto2021-12-111-19/+13
|
* Added batch modeSebastiano Tronto2021-12-102-10/+18
|
* Fixed segfault when passing malformed command arguments to solveSebastiano Tronto2021-12-101-4/+4
|
* Added gen command and modified installation instructions for tablesSebastiano Tronto2021-12-103-0/+74
|
* Fixed genptable for small tables and tables that do not use symmetrySebastiano Tronto2021-12-091-1/+5
|
* Multi-threaded pruning table generation - now it's actually fast :)Sebastiano Tronto2021-12-096-37/+114
|
* Just refortmatting and added one typeSebastiano Tronto2021-12-083-170/+191
|
* tiny cleanupSebastiano Tronto2021-12-081-1/+1
|
* CleanupSebastiano Tronto2021-12-081-176/+0
|
* Faster and nice pruning table generation. Can still be improved with ↵Sebastiano Tronto2021-12-084-38/+110
| | | | multithreading.
* Faster ptable generation (but I can make it faster)Sebastiano Tronto2021-12-081-9/+45
|
* Expanded on previous comment: now it contains an idea of solutionSebastiano Tronto2021-12-071-0/+19
|
* Just added a commentSebastiano Tronto2021-12-071-0/+8
|

Generated with cgit - Back to sebastiano.tronto.net