aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
...
* Fixed example sectionSebastiano Tronto2021-12-271-11/+22
|
* Changed installation instructions (for pruning tables)Sebastiano Tronto2021-12-273-46/+39
|
* Added option -i to accept scramble(s) from stdin, very useful for batch modeSebastiano Tronto2021-12-276-17/+44
|
* Added scramble commandSebastiano Tronto2021-12-2612-36/+204
|
* Added two-phase solverSebastiano Tronto2021-12-2611-33/+171
|
* Better trans-detection system (for e.g. drfin for HTR scramble)Sebastiano Tronto2021-12-266-155/+97
|
* Added -O option for solve (specify number of moves within optimal)Sebastiano Tronto2021-12-257-12/+34
|
* Added the invert and unniss commandsSebastiano Tronto2021-12-256-3/+62
|
* Updated TODO.md, boldfaced things to do before releaseSebastiano Tronto2021-12-251-16/+20
|
* Updated package and windows binarySebastiano Tronto2021-12-252-0/+0
|
* Transform solutions early so that -v gives meaningful infoSebastiano Tronto2021-12-253-13/+15
|
* Changed -s (max solutions) option to -n and -n (NISS) to -NSebastiano Tronto2021-12-256-17/+18
|
* Better error message when option for solve is unrecognizedSebastiano Tronto2021-12-253-3/+13
|
* added info on compact tables and warning about installation process being ↵Sebastiano Tronto2021-12-242-10/+21
| | | | deprecated for tables
* added latest commits to beta9Sebastiano Tronto2021-12-242-0/+0
|
* removed some todoSebastiano Tronto2021-12-241-2/+0
|
* added some optimal-after-EO stepsSebastiano Tronto2021-12-242-0/+63
|
* changed a wordSebastiano Tronto2021-12-242-3/+3
|
* Cited nxopt, updated performance descriptionSebastiano Tronto2021-12-245-20/+19
|
* Fixed bug that prevented switching depending on branch factor (leftover from ↵Sebastiano Tronto2021-12-242-3/+0
| | | | previous debugging)
* Changed default behavior of -sSebastiano Tronto2021-12-244-1/+25
|
* Added -c option for solveSebastiano Tronto2021-12-246-11/+43
|
* Bump beta versionSebastiano Tronto2021-12-246-18/+1
|
* use nxopt31 (compressed) by default for optimal solvingSebastiano Tronto2021-12-246-23/+43
|
* Fixes for yesterday's commitSebastiano Tronto2021-12-236-12/+33
|
* Added the possibility to compress tables to 2 bits per entry.Sebastiano Tronto2021-12-234-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.
* Added some TODOsSebastiano Tronto2021-12-231-6/+14
|
* fixed typoSebastiano Tronto2021-12-222-2/+1
|
* bump versionSebastiano Tronto2021-12-175-1/+1
|
* some progressSebastiano Tronto2021-12-179-62/+48
|
* Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto2021-12-1616-332/+555
| | | | | | | 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-143-3/+11
|
* Added light optimal solver - about 5 times slower but takes only 500Mb of RAMSebastiano Tronto2021-12-145-18/+129
|
* updated binary and src packageSebastiano Tronto2021-12-142-0/+0
|
* Better output in batch modeSebastiano Tronto2021-12-142-5/+14
|
* removed old inverse_cube()Sebastiano Tronto2021-12-142-38/+0
|
* minor restylingSebastiano Tronto2021-12-141-2/+3
|
* little restylingSebastiano Tronto2021-12-142-24/+19
|
* random attemptsSebastiano Tronto2021-12-143-32/+34
|
* Faster optimal solver.Sebastiano Tronto2021-12-1313-288/+618
| | | | | | | | | | | 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.
* bumped version numberSebastiano Tronto2021-12-125-1/+1
|
* Faster inverse cube; makes optimal solving about 30% fasterSebastiano Tronto2021-12-127-5/+245
|
* Improved where_is_edgeSebastiano Tronto2021-12-113-19/+14
|
* added todo for improvement of batch modeSebastiano Tronto2021-12-101-0/+1
|
* Removed todo batch modeSebastiano Tronto2021-12-101-2/+0
|
* Added batch modeSebastiano Tronto2021-12-105-19/+36
|
* Removed one todo, added anotherSebastiano Tronto2021-12-102-1/+1
|
* 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-1010-25/+133
|
* Fixed genptable for small tables and tables that do not use symmetrySebastiano Tronto2021-12-092-1/+5
|

Generated with cgit - Back to sebastiano.tronto.net