| Commit message (Collapse) | Author | Files | Lines | ||
|---|---|---|---|---|---|
| 2022-02-27 | Removed some unused code (khuge). Improved optimal solver performance by ↵ | Sebastiano Tronto | 1 | -31/+0 | |
| about 10% using raw transition tables (same for dr step). | |||||
| 2022-02-27 | Removed array-size constants for certain objects (steps, commands...) | Sebastiano Tronto | 1 | -1/+3 | |
| 2021-12-26 | Added two-phase solver | Sebastiano Tronto | 1 | -1/+1 | |
| 2021-12-26 | Better trans-detection system (for e.g. drfin for HTR scramble) | Sebastiano Tronto | 1 | -124/+41 | |
| 2021-12-24 | added some optimal-after-EO steps | Sebastiano Tronto | 1 | -0/+63 | |
| 2021-12-24 | Added -c option for solve | Sebastiano Tronto | 1 | -0/+20 | |
| 2021-12-24 | use nxopt31 (compressed) by default for optimal solving | Sebastiano Tronto | 1 | -10/+15 | |
| 2021-12-23 | Fixes for yesterday's commit | Sebastiano Tronto | 1 | -1/+4 | |
| 2021-12-22 | fixed typo | Sebastiano Tronto | 1 | -2/+1 | |
| 2021-12-17 | some progress | Sebastiano Tronto | 1 | -20/+10 | |
| 2021-12-16 | Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵ | Sebastiano Tronto | 1 | -105/+141 | |
| 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-14 | fixed a bug | Sebastiano Tronto | 1 | -0/+4 | |
| 2021-12-14 | Added light optimal solver - about 5 times slower but takes only 500Mb of RAM | Sebastiano Tronto | 1 | -7/+119 | |
| 2021-12-14 | minor restyling | Sebastiano Tronto | 1 | -2/+3 | |
| 2021-12-14 | little restyling | Sebastiano Tronto | 1 | -24/+19 | |
| 2021-12-14 | random attempts | Sebastiano Tronto | 1 | -27/+29 | |
| 2021-12-13 | Faster optimal solver. | Sebastiano Tronto | 1 | -144/+355 | |
| 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-09 | Multi-threaded pruning table generation - now it's actually fast :) | Sebastiano Tronto | 1 | -2/+2 | |
| 2021-12-07 | Little performance improvement in optimal solver - more to come! | Sebastiano Tronto | 1 | -105/+172 | |
| 2021-12-03 | Some attempts at using the inverse scramble to get more info for pruning ↵ | Sebastiano Tronto | 1 | -10/+23 | |
| (optimal solving) | |||||
| 2021-11-20 | Multithreading seems to be working now, it was easier than expected! | Sebastiano Tronto | 1 | -12/+1 | |
| 2021-11-15 | Load all necessary pruning tables for a step before the actual solving process | Sebastiano Tronto | 1 | -0/+142 | |
| starts. This is in preparation for multi-threaded solving (but don't get hyped, it will take time). | |||||
| 2021-11-12 | Unimportant fixed | Sebastiano Tronto | 1 | -1/+1 | |
| 2021-11-11 | Rewritten from scratch. Welocme nissy 2.0! | Sebastiano Tronto | 1 | -0/+941 | |
 |
index : nissy | |
| Where is nissy? |
| aboutsummaryrefslogtreecommitdiff |
Generated with cgit - Back to sebastiano.tronto.net