aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
...
* 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
|
* removed/added some TODOsSebastiano Tronto2021-12-091-10/+2
|
* Multi-threaded pruning table generation - now it's actually fast :)Sebastiano Tronto2021-12-097-37/+114
|
* Just refortmatting and added one typeSebastiano Tronto2021-12-084-170/+191
|
* tiny cleanupSebastiano Tronto2021-12-081-1/+1
|
* CleanupSebastiano Tronto2021-12-082-180/+0
|
* Faster and nice pruning table generation. Can still be improved with ↵Sebastiano Tronto2021-12-085-38/+110
| | | | multithreading.
* Faster ptable generation (but I can make it faster)Sebastiano Tronto2021-12-083-11/+66
|
* 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
|
* Little performance improvement in optimal solver - more to come!Sebastiano Tronto2021-12-0710-167/+278
|
* Fixed typo in commentSebastiano Tronto2021-12-061-1/+1
|
* Removed some useless spaces (they made some sense once)Sebastiano Tronto2021-12-031-9/+9
|
* Some attempts at using the inverse scramble to get more info for pruning ↵Sebastiano Tronto2021-12-033-15/+32
| | | | (optimal solving)
* Moved a bunch of commented code to the bottom of the file. I still don't ↵Sebastiano Tronto2021-12-031-121/+116
| | | | want to throw it away and it makes sense to keep it in this file for quick lookup.
* Fix issues #1 and #2 (thanks to Thomas Rokicki)Sebastiano Tronto2021-12-031-8/+8
|
* Added possibility of having end-of-line comments with double slash (single ↵Sebastiano Tronto2021-11-285-3/+14
| | | | slash actually); fixed a small memory leak
* added -static, minor changesSebastiano Tronto2021-11-272-3/+5
|
* Added some TODOsSebastiano Tronto2021-11-261-1/+3
|
* Fixing the fix (the previous commit introduced a bug when the step was not ↵Sebastiano Tronto2021-11-262-3/+3
| | | | specified) + minor fixes in shell
* Fixed a bug in freeing memory after execution of certain commands (thanks to ↵Sebastiano Tronto2021-11-252-16/+23
| | | | Tommaso for reporting)
* Added comments on multi-threading and windows installation instructionsSebastiano Tronto2021-11-201-7/+16
|
* Added windows binarySebastiano Tronto2021-11-206-7/+34
|
* Removed old fileSebastiano Tronto2021-11-201-0/+0
|
* Bugfix in reading scrambleSebastiano Tronto2021-11-204-6/+3
|

Generated with cgit - Back to sebastiano.tronto.net