diff options
Diffstat (limited to 'TODO.md')
| -rw-r--r-- | TODO.md | 13 |
1 files changed, 11 insertions, 2 deletions
| @@ -9,8 +9,8 @@ It's more of a personal reminder than anything else. | |||
| 9 | of the files includes + doing more stuff. A static "initiliazed" | 9 | of the files includes + doing more stuff. A static "initiliazed" |
| 10 | variable is probably needed too. | 10 | variable is probably needed too. |
| 11 | ### testing! | 11 | ### testing! |
| 12 | * test fst: implement fst_consistent | 12 | * generic test util: function taking an array of tests, an array of testnames |
| 13 | * test fst: init_fst is necessary before testing move and inverse | 13 | (or maybe tests should be their own type?) and running them |
| 14 | * separate "commands" for testing different parts (e.g. ./test coord) | 14 | * separate "commands" for testing different parts (e.g. ./test coord) |
| 15 | * test coordinate (needed anyway to test fst) | 15 | * test coordinate (needed anyway to test fst) |
| 16 | * other tests (start from bottom: utils.c) | 16 | * other tests (start from bottom: utils.c) |
| @@ -19,10 +19,15 @@ It's more of a personal reminder than anything else. | |||
| 19 | * add Void * extradata to DfsArg and a custom move function | 19 | * add Void * extradata to DfsArg and a custom move function |
| 20 | * add optional custom pre-process for generating special table (nx) | 20 | * add optional custom pre-process for generating special table (nx) |
| 21 | * copy_dfsdata should copy extra too! | 21 | * copy_dfsdata should copy extra too! |
| 22 | ### Solving simplification / refactor | ||
| 23 | * Split solve in solve_coord, solve_generic, solve_singlethread... | ||
| 24 | * Rework choicesteps: simplify, remove one type of rotation... | ||
| 22 | ### nx.c | 25 | ### nx.c |
| 23 | * implement nxopt with all tables and all tricks | 26 | * implement nxopt with all tables and all tricks |
| 24 | (maybe compile time variable for maximum memory to use?) | 27 | (maybe compile time variable for maximum memory to use?) |
| 25 | * is_valid should also unniss / cleanup the alg | 28 | * is_valid should also unniss / cleanup the alg |
| 29 | ### Other easy refactor | ||
| 30 | * split cubetypes.h into other files | ||
| 26 | 31 | ||
| 27 | ## For version 2.1 | 32 | ## For version 2.1 |
| 28 | ### Changes to Step and Solve | 33 | ### Changes to Step and Solve |
| @@ -47,9 +52,11 @@ It's more of a personal reminder than anything else. | |||
| 47 | check if found enough solutions before checking pruning values) | 52 | check if found enough solutions before checking pruning values) |
| 48 | ### Technical | 53 | ### Technical |
| 49 | * generic option parser | 54 | * generic option parser |
| 55 | * scan system to get best number of threads | ||
| 50 | ### Commands | 56 | ### Commands |
| 51 | * Easy: add option -I (inverse) and -L (linear, like inverse + normal) | 57 | * Easy: add option -I (inverse) and -L (linear, like inverse + normal) |
| 52 | to do only linear NISS | 58 | to do only linear NISS |
| 59 | * message for -N ignored say -n (lowercase) | ||
| 53 | 60 | ||
| 54 | ## Commands | 61 | ## Commands |
| 55 | 62 | ||
| @@ -75,6 +82,8 @@ including e.g. solutions that were not shown because -c) | |||
| 75 | * solve should try up to a small bound without loading the large pruning table | 82 | * solve should try up to a small bound without loading the large pruning table |
| 76 | (maybe this is not necessary if loading the table is fast enough) | 83 | (maybe this is not necessary if loading the table is fast enough) |
| 77 | * silent batch mode without >>> | 84 | * silent batch mode without >>> |
| 85 | * Optimal solver: when asking for only one solution, scan for upper bound in | ||
| 86 | parallel using a two-phase solver. | ||
| 78 | 87 | ||
| 79 | ### New features | 88 | ### New features |
| 80 | * EO analysis (and also DR and HTR analysis): group similar EOs together | 89 | * EO analysis (and also DR and HTR analysis): group similar EOs together |