| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | fixed a bug | Sebastiano Tronto | 2021-12-14 | 1 | -0/+0 |
| | | |||||
| * | Added light optimal solver - about 5 times slower but takes only 500Mb of RAM | Sebastiano Tronto | 2021-12-14 | 1 | -0/+0 |
| | | |||||
| * | Better output in batch mode | Sebastiano Tronto | 2021-12-14 | 1 | -0/+0 |
| | | |||||
| * | removed old inverse_cube() | Sebastiano Tronto | 2021-12-14 | 1 | -0/+0 |
| | | |||||
| * | random attempts | Sebastiano Tronto | 2021-12-14 | 1 | -0/+0 |
| | | |||||
| * | Faster optimal solver. | Sebastiano Tronto | 2021-12-13 | 1 | -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 number | Sebastiano Tronto | 2021-12-12 | 1 | -0/+0 |
| | | |||||
| * | Faster inverse cube; makes optimal solving about 30% faster | Sebastiano Tronto | 2021-12-12 | 1 | -0/+0 |
| | | |||||
| * | Improved where_is_edge | Sebastiano Tronto | 2021-12-11 | 1 | -0/+0 |
| | | |||||
| * | Added batch mode | Sebastiano Tronto | 2021-12-10 | 1 | -0/+0 |
| | | |||||
| * | Removed one todo, added another | Sebastiano Tronto | 2021-12-10 | 1 | -0/+0 |
| | | |||||
| * | Added gen command and modified installation instructions for tables | Sebastiano Tronto | 2021-12-10 | 1 | -0/+0 |
| | | |||||
| * | Fixed genptable for small tables and tables that do not use symmetry | Sebastiano Tronto | 2021-12-09 | 1 | -0/+0 |
| | | |||||
| * | Multi-threaded pruning table generation - now it's actually fast :) | Sebastiano Tronto | 2021-12-09 | 1 | -0/+0 |
| | | |||||
| * | Just refortmatting and added one type | Sebastiano Tronto | 2021-12-08 | 1 | -0/+0 |
| | | |||||
| * | Faster and nice pruning table generation. Can still be improved with ↵ | Sebastiano Tronto | 2021-12-08 | 1 | -0/+0 |
| | | | | | multithreading. | ||||
| * | Faster ptable generation (but I can make it faster) | Sebastiano Tronto | 2021-12-08 | 1 | -0/+0 |
| | | |||||
| * | Little performance improvement in optimal solver - more to come! | Sebastiano Tronto | 2021-12-07 | 1 | -0/+0 |
| | | |||||
| * | Some attempts at using the inverse scramble to get more info for pruning ↵ | Sebastiano Tronto | 2021-12-03 | 1 | -0/+0 |
| | | | | | (optimal solving) | ||||
| * | Rewritten from scratch. Welocme nissy 2.0! | Sebastiano Tronto | 2021-11-11 | 1 | -0/+0 |
| | | |||||
| * | Added CO first command | Sebastiano Tronto | 2020-09-22 | 1 | -0/+0 |
| | | |||||
| * | Bugfix: NISS and pruning table check | Sebastiano Tronto | 2020-09-19 | 1 | -0/+0 |
| | | |||||
| * | Copied documentation into code | Sebastiano Tronto | 2020-09-13 | 1 | -0/+0 |
| | | |||||
| * | Changed compile options to -O2 | Sebastiano Tronto | 2020-08-30 | 1 | -0/+0 |
| | | |||||
| * | added command clear | Sebastiano Tronto | 2020-07-27 | 1 | -0/+0 |
| | | |||||
| * | Fixed a bug with NISS | Sebastiano Tronto | 2020-07-27 | 1 | -0/+0 |
| | | |||||
| * | Added more scramble options, scramble doc | Sebastiano Tronto | 2020-07-20 | 1 | -0/+0 |
| | | |||||
| * | Added feature: scramble | Sebastiano Tronto | 2020-07-12 | 1 | -0/+0 |
| | | |||||
| * | Bug fix | Sebastiano Tronto | 2020-07-11 | 1 | -0/+0 |
| | | |||||
| * | First push | Sebastiano Tronto | 2020-06-21 | 1 | -0/+0 |
 |
index : nissy-classic | |
| Stable branch of nissy |
| aboutsummaryrefslogtreecommitdiff |
Generated with cgit - Back to sebastiano.tronto.net