aboutsummaryrefslogtreecommitdiff
path: root/nissy (unfollow)
Commit message (Collapse)AuthorFilesLines
2021-12-23Fixes for yesterday's commitSebastiano Tronto1-0/+0
2021-12-23Added the possibility to compress tables to 2 bits per entry.Sebastiano Tronto1-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.
2021-12-22fixed typoSebastiano Tronto1-0/+0
2021-12-17bump versionSebastiano Tronto1-0/+0
2021-12-17some progressSebastiano Tronto1-0/+0
2021-12-16Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto1-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.
2021-12-14fixed a bugSebastiano Tronto1-0/+0
2021-12-14Added light optimal solver - about 5 times slower but takes only 500Mb of RAMSebastiano Tronto1-0/+0
2021-12-14Better output in batch modeSebastiano Tronto1-0/+0
2021-12-14removed old inverse_cube()Sebastiano Tronto1-0/+0
2021-12-14random attemptsSebastiano Tronto1-0/+0
2021-12-13Faster optimal solver.Sebastiano Tronto1-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.
2021-12-12bumped version numberSebastiano Tronto1-0/+0
2021-12-12Faster inverse cube; makes optimal solving about 30% fasterSebastiano Tronto1-0/+0
2021-12-11Improved where_is_edgeSebastiano Tronto1-0/+0
2021-12-10Added batch modeSebastiano Tronto1-0/+0
2021-12-10Removed one todo, added anotherSebastiano Tronto1-0/+0
2021-12-10Added gen command and modified installation instructions for tablesSebastiano Tronto1-0/+0
2021-12-09Fixed genptable for small tables and tables that do not use symmetrySebastiano Tronto1-0/+0
2021-12-09Multi-threaded pruning table generation - now it's actually fast :)Sebastiano Tronto1-0/+0
2021-12-08Just refortmatting and added one typeSebastiano Tronto1-0/+0
2021-12-08Faster and nice pruning table generation. Can still be improved with ↵Sebastiano Tronto1-0/+0
multithreading.
2021-12-08Faster ptable generation (but I can make it faster)Sebastiano Tronto1-0/+0
2021-12-07Little performance improvement in optimal solver - more to come!Sebastiano Tronto1-0/+0
2021-12-03Some attempts at using the inverse scramble to get more info for pruning ↵Sebastiano Tronto1-0/+0
(optimal solving)
2021-11-11Rewritten from scratch. Welocme nissy 2.0!Sebastiano Tronto1-0/+0
2020-09-22Added CO first commandSebastiano Tronto1-0/+0
2020-09-19Bugfix: NISS and pruning table checkSebastiano Tronto1-0/+0
2020-09-13Copied documentation into codeSebastiano Tronto1-0/+0
2020-08-30Changed compile options to -O2Sebastiano Tronto1-0/+0
2020-07-27added command clearSebastiano Tronto1-0/+0
2020-07-27Fixed a bug with NISSSebastiano Tronto1-0/+0
2020-07-20Added more scramble options, scramble docSebastiano Tronto1-0/+0
2020-07-12Added feature: scrambleSebastiano Tronto1-0/+0
2020-07-11Bug fixSebastiano Tronto1-0/+0
2020-06-21First pushSebastiano Tronto1-0/+0

Generated with cgit - Back to sebastiano.tronto.net