aboutsummaryrefslogtreecommitdiff
path: root/TODO.md (unfollow)
Commit message (Collapse)AuthorFilesLines
2022-01-10Added TODOs for version 2.1Sebastiano Tronto1-1/+17
2021-12-27change make cleanSebastiano Tronto1-1/+0
2021-12-27Changed installation instructions (for pruning tables)Sebastiano Tronto1-4/+2
2021-12-26Added scramble commandSebastiano Tronto1-3/+2
2021-12-26Added two-phase solverSebastiano Tronto1-1/+1
2021-12-26Better trans-detection system (for e.g. drfin for HTR scramble)Sebastiano Tronto1-6/+4
2021-12-25Added -O option for solve (specify number of moves within optimal)Sebastiano Tronto1-3/+2
2021-12-25Added the invert and unniss commandsSebastiano Tronto1-2/+4
2021-12-25Updated TODO.md, boldfaced things to do before releaseSebastiano Tronto1-16/+20
2021-12-25Transform solutions early so that -v gives meaningful infoSebastiano Tronto1-2/+0
2021-12-25Changed -s (max solutions) option to -n and -n (NISS) to -NSebastiano Tronto1-1/+2
2021-12-25Better error message when option for solve is unrecognizedSebastiano Tronto1-0/+1
2021-12-24added info on compact tables and warning about installation process being ↵Sebastiano Tronto1-5/+1
deprecated for tables
2021-12-24removed some todoSebastiano Tronto1-2/+0
2021-12-24Cited nxopt, updated performance descriptionSebastiano Tronto1-2/+0
2021-12-24Added -c option for solveSebastiano Tronto1-0/+1
2021-12-24use nxopt31 (compressed) by default for optimal solvingSebastiano Tronto1-0/+6
2021-12-23Fixes for yesterday's commitSebastiano Tronto1-0/+2
2021-12-23Added some TODOsSebastiano Tronto1-6/+14
2021-12-16Added a new pruning table (equivalent to nxopt31). I have not tested it yet, ↵Sebastiano Tronto1-9/+8
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-3/+7
2021-12-14Added light optimal solver - about 5 times slower but takes only 500Mb of RAMSebastiano Tronto1-3/+0
2021-12-14random attemptsSebastiano Tronto1-5/+5
2021-12-13Faster optimal solver.Sebastiano Tronto1-0/+1
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-11Improved where_is_edgeSebastiano Tronto1-0/+1
2021-12-10added todo for improvement of batch modeSebastiano Tronto1-0/+1
2021-12-10Removed todo batch modeSebastiano Tronto1-2/+0
2021-12-10Removed one todo, added anotherSebastiano Tronto1-1/+1
2021-12-10Added gen command and modified installation instructions for tablesSebastiano Tronto1-7/+1
2021-12-09removed/added some TODOsSebastiano Tronto1-10/+2
2021-12-08CleanupSebastiano Tronto1-4/+0
2021-12-08Faster ptable generation (but I can make it faster)Sebastiano Tronto1-2/+21
2021-12-07Little performance improvement in optimal solver - more to come!Sebastiano Tronto1-0/+3
2021-11-26Added some TODOsSebastiano Tronto1-1/+3
2021-11-20Bugfix in reading scrambleSebastiano Tronto1-3/+0
2021-11-20Multithreading seems to be working now, it was easier than expected!Sebastiano Tronto1-8/+3
2021-11-17Use inttypes.h macros to print uint64_t variables (this requires -std=c99). ↵Sebastiano Tronto1-0/+6
Added a couple of TODOs
2021-11-15Fixed used of uninitialized aux variableSebastiano Tronto1-0/+3
2021-11-12Added an itemSebastiano Tronto1-0/+4
2021-11-11Rewritten from scratch. Welocme nissy 2.0!Sebastiano Tronto1-0/+53

Generated with cgit - Back to sebastiano.tronto.net