aboutsummaryrefslogtreecommitdiff
path: root/nissy (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Added one adhoc test (cornerhtr from CO)Sebastiano Tronto2022-01-151-0/+0
|
* Added pdf doc in doc folderSebastiano Tronto2021-12-291-0/+0
|
* bumped windows versionSebastiano Tronto2021-12-281-0/+0
|
* Bumped to rc1Sebastiano Tronto2021-12-271-0/+0
|
* Added option -i to accept scramble(s) from stdin, very useful for batch modeSebastiano Tronto2021-12-271-0/+0
|
* Added scramble commandSebastiano Tronto2021-12-261-0/+0
|
* Added two-phase solverSebastiano Tronto2021-12-261-0/+0
|
* Better trans-detection system (for e.g. drfin for HTR scramble)Sebastiano Tronto2021-12-261-0/+0
|
* Added -O option for solve (specify number of moves within optimal)Sebastiano Tronto2021-12-251-0/+0
|
* Added the invert and unniss commandsSebastiano Tronto2021-12-251-0/+0
|
* Transform solutions early so that -v gives meaningful infoSebastiano Tronto2021-12-251-0/+0
|
* Changed -s (max solutions) option to -n and -n (NISS) to -NSebastiano Tronto2021-12-251-0/+0
|
* Better error message when option for solve is unrecognizedSebastiano Tronto2021-12-251-0/+0
|
* added latest commits to beta9Sebastiano Tronto2021-12-241-0/+0
|
* added some optimal-after-EO stepsSebastiano Tronto2021-12-241-0/+0
|
* changed a wordSebastiano Tronto2021-12-241-0/+0
|
* Cited nxopt, updated performance descriptionSebastiano Tronto2021-12-241-0/+0
|
* Fixed bug that prevented switching depending on branch factor (leftover from ↵Sebastiano Tronto2021-12-241-0/+0
| | | | previous debugging)
* Changed default behavior of -sSebastiano Tronto2021-12-241-0/+0
|
* Added -c option for solveSebastiano Tronto2021-12-241-0/+0
|
* Bump beta versionSebastiano Tronto2021-12-241-0/+0
|
* use nxopt31 (compressed) by default for optimal solvingSebastiano Tronto2021-12-241-0/+0
|
* Fixes for yesterday's commitSebastiano Tronto2021-12-231-0/+0
|
* Added the possibility to compress tables to 2 bits per entry.Sebastiano Tronto2021-12-231-0/+0
| | | | | | | | | | | | 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-0/+0
|
* bump versionSebastiano Tronto2021-12-171-0/+0
|
* some progressSebastiano Tronto2021-12-171-0/+0
|
* Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto2021-12-161-0/+0
| | | | | | | 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/+0
|
* Added light optimal solver - about 5 times slower but takes only 500Mb of RAMSebastiano Tronto2021-12-141-0/+0
|
* Better output in batch modeSebastiano Tronto2021-12-141-0/+0
|
* removed old inverse_cube()Sebastiano Tronto2021-12-141-0/+0
|
* random attemptsSebastiano Tronto2021-12-141-0/+0
|
* Faster optimal solver.Sebastiano Tronto2021-12-131-0/+0
| | | | | | | | | | | 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-121-0/+0
|
* Faster inverse cube; makes optimal solving about 30% fasterSebastiano Tronto2021-12-121-0/+0
|
* Improved where_is_edgeSebastiano Tronto2021-12-111-0/+0
|
* Added batch modeSebastiano Tronto2021-12-101-0/+0
|
* Removed one todo, added anotherSebastiano Tronto2021-12-101-0/+0
|
* Added gen command and modified installation instructions for tablesSebastiano Tronto2021-12-101-0/+0
|
* Fixed genptable for small tables and tables that do not use symmetrySebastiano Tronto2021-12-091-0/+0
|
* Multi-threaded pruning table generation - now it's actually fast :)Sebastiano Tronto2021-12-091-0/+0
|
* Just refortmatting and added one typeSebastiano Tronto2021-12-081-0/+0
|
* Faster and nice pruning table generation. Can still be improved with ↵Sebastiano Tronto2021-12-081-0/+0
| | | | multithreading.
* Faster ptable generation (but I can make it faster)Sebastiano Tronto2021-12-081-0/+0
|
* Little performance improvement in optimal solver - more to come!Sebastiano Tronto2021-12-071-0/+0
|
* Some attempts at using the inverse scramble to get more info for pruning ↵Sebastiano Tronto2021-12-031-0/+0
| | | | (optimal solving)
* Rewritten from scratch. Welocme nissy 2.0!Sebastiano Tronto2021-11-111-0/+0
|
* Added CO first commandSebastiano Tronto2020-09-221-0/+0
|
* Bugfix: NISS and pruning table checkSebastiano Tronto2020-09-191-0/+0
|

Generated with cgit - Back to sebastiano.tronto.net