| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Cited nxopt, updated performance description | Sebastiano Tronto | 2021-12-24 | 5 | -20/+19 | |
| | | ||||||
| * | Fixed bug that prevented switching depending on branch factor (leftover from ↵ | Sebastiano Tronto | 2021-12-24 | 2 | -3/+0 | |
| | | | | | previous debugging) | |||||
| * | Changed default behavior of -s | Sebastiano Tronto | 2021-12-24 | 4 | -1/+25 | |
| | | ||||||
| * | Added -c option for solve | Sebastiano Tronto | 2021-12-24 | 6 | -11/+43 | |
| | | ||||||
| * | Bump beta version | Sebastiano Tronto | 2021-12-24 | 6 | -18/+1 | |
| | | ||||||
| * | use nxopt31 (compressed) by default for optimal solving | Sebastiano Tronto | 2021-12-24 | 6 | -23/+43 | |
| | | ||||||
| * | Fixes for yesterday's commit | Sebastiano Tronto | 2021-12-23 | 6 | -12/+33 | |
| | | ||||||
| * | Added the possibility to compress tables to 2 bits per entry. | Sebastiano Tronto | 2021-12-23 | 4 | -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 TODOs | Sebastiano Tronto | 2021-12-23 | 1 | -6/+14 | |
| | | ||||||
| * | fixed typo | Sebastiano Tronto | 2021-12-22 | 2 | -2/+1 | |
| | | ||||||
| * | bump version | Sebastiano Tronto | 2021-12-17 | 5 | -1/+1 | |
| | | ||||||
| * | some progress | Sebastiano Tronto | 2021-12-17 | 9 | -62/+48 | |
| | | ||||||
| * | Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵ | Sebastiano Tronto | 2021-12-16 | 16 | -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 bug | Sebastiano Tronto | 2021-12-14 | 3 | -3/+11 | |
| | | ||||||
| * | Added light optimal solver - about 5 times slower but takes only 500Mb of RAM | Sebastiano Tronto | 2021-12-14 | 5 | -18/+129 | |
| | | ||||||
| * | updated binary and src package | Sebastiano Tronto | 2021-12-14 | 2 | -0/+0 | |
| | | ||||||
| * | Better output in batch mode | Sebastiano Tronto | 2021-12-14 | 2 | -5/+14 | |
| | | ||||||
| * | removed old inverse_cube() | Sebastiano Tronto | 2021-12-14 | 2 | -38/+0 | |
| | | ||||||
| * | minor restyling | Sebastiano Tronto | 2021-12-14 | 1 | -2/+3 | |
| | | ||||||
| * | little restyling | Sebastiano Tronto | 2021-12-14 | 2 | -24/+19 | |
| | | ||||||
| * | random attempts | Sebastiano Tronto | 2021-12-14 | 3 | -32/+34 | |
| | | ||||||
| * | Faster optimal solver. | Sebastiano Tronto | 2021-12-13 | 13 | -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 number | Sebastiano Tronto | 2021-12-12 | 5 | -1/+1 | |
| | | ||||||
| * | Faster inverse cube; makes optimal solving about 30% faster | Sebastiano Tronto | 2021-12-12 | 7 | -5/+245 | |
| | | ||||||
| * | Improved where_is_edge | Sebastiano Tronto | 2021-12-11 | 3 | -19/+14 | |
| | | ||||||
| * | added todo for improvement of batch mode | Sebastiano Tronto | 2021-12-10 | 1 | -0/+1 | |
| | | ||||||
| * | Removed todo batch mode | Sebastiano Tronto | 2021-12-10 | 1 | -2/+0 | |
| | | ||||||
| * | Added batch mode | Sebastiano Tronto | 2021-12-10 | 5 | -19/+36 | |
| | | ||||||
| * | Removed one todo, added another | Sebastiano Tronto | 2021-12-10 | 2 | -1/+1 | |
| | | ||||||
| * | Fixed segfault when passing malformed command arguments to solve | Sebastiano Tronto | 2021-12-10 | 1 | -4/+4 | |
| | | ||||||
| * | Added gen command and modified installation instructions for tables | Sebastiano Tronto | 2021-12-10 | 10 | -25/+133 | |
| | | ||||||
| * | Fixed genptable for small tables and tables that do not use symmetry | Sebastiano Tronto | 2021-12-09 | 2 | -1/+5 | |
| | | ||||||
| * | removed/added some TODOs | Sebastiano Tronto | 2021-12-09 | 1 | -10/+2 | |
| | | ||||||
| * | Multi-threaded pruning table generation - now it's actually fast :) | Sebastiano Tronto | 2021-12-09 | 7 | -37/+114 | |
| | | ||||||
| * | Just refortmatting and added one type | Sebastiano Tronto | 2021-12-08 | 4 | -170/+191 | |
| | | ||||||
| * | tiny cleanup | Sebastiano Tronto | 2021-12-08 | 1 | -1/+1 | |
| | | ||||||
| * | Cleanup | Sebastiano Tronto | 2021-12-08 | 2 | -180/+0 | |
| | | ||||||
| * | Faster and nice pruning table generation. Can still be improved with ↵ | Sebastiano Tronto | 2021-12-08 | 5 | -38/+110 | |
| | | | | | multithreading. | |||||
| * | Faster ptable generation (but I can make it faster) | Sebastiano Tronto | 2021-12-08 | 3 | -11/+66 | |
| | | ||||||
| * | Expanded on previous comment: now it contains an idea of solution | Sebastiano Tronto | 2021-12-07 | 1 | -0/+19 | |
| | | ||||||
| * | Just added a comment | Sebastiano Tronto | 2021-12-07 | 1 | -0/+8 | |
| | | ||||||
| * | Little performance improvement in optimal solver - more to come! | Sebastiano Tronto | 2021-12-07 | 10 | -167/+278 | |
| | | ||||||
| * | Fixed typo in comment | Sebastiano Tronto | 2021-12-06 | 1 | -1/+1 | |
| | | ||||||
| * | Removed some useless spaces (they made some sense once) | Sebastiano Tronto | 2021-12-03 | 1 | -9/+9 | |
| | | ||||||
| * | Some attempts at using the inverse scramble to get more info for pruning ↵ | Sebastiano Tronto | 2021-12-03 | 3 | -15/+32 | |
| | | | | | (optimal solving) | |||||
| * | Moved a bunch of commented code to the bottom of the file. I still don't ↵ | Sebastiano Tronto | 2021-12-03 | 1 | -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 Tronto | 2021-12-03 | 1 | -8/+8 | |
| | | ||||||
| * | Added possibility of having end-of-line comments with double slash (single ↵ | Sebastiano Tronto | 2021-11-28 | 5 | -3/+14 | |
| | | | | | slash actually); fixed a small memory leak | |||||
| * | added -static, minor changes | Sebastiano Tronto | 2021-11-27 | 2 | -3/+5 | |
| | | ||||||
| * | Added some TODOs | Sebastiano Tronto | 2021-11-26 | 1 | -1/+3 | |
| | | ||||||
