diff options
| author | Sebastiano Tronto <sebastiano@tronto.net> | 2023-05-01 16:33:51 +0200 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano@tronto.net> | 2023-05-01 16:33:51 +0200 |
| commit | bf44088d4373a9520e860152c56a958332819c4b (patch) | |
| tree | ea35c847a1d82aa715e1fc1c76e4a24462255051 /TODO/2.1.md | |
| parent | 1a5bfe9b08707b0aef748d7921a419ba4a046fba (diff) | |
| download | nissy-bf44088d4373a9520e860152c56a958332819c4b.tar.gz nissy-bf44088d4373a9520e860152c56a958332819c4b.zip | |
Split nissy in other repos, see README.md
Diffstat (limited to '')
| -rw-r--r-- | TODO/2.1.md | 51 |
1 files changed, 0 insertions, 51 deletions
diff --git a/TODO/2.1.md b/TODO/2.1.md deleted file mode 100644 index 7448094..0000000 --- a/TODO/2.1.md +++ /dev/null | |||
| @@ -1,51 +0,0 @@ | |||
| 1 | # TODO-list for version 2.1 (or is it 3.0 at this point?) | ||
| 2 | |||
| 3 | ## Rework solver | ||
| 4 | |||
| 5 | ### 1. Implement minimum viable | ||
| 6 | |||
| 7 | * Implement nxopt31 with fst_cube. Remember that the function | ||
| 8 | move_check_solved() should do one axis at the time, so that we don't move | ||
| 9 | everything before checking. | ||
| 10 | * test? | ||
| 11 | |||
| 12 | ### 2. Rework achitecture and file dependencies | ||
| 13 | |||
| 14 | * solve.h depends only on moves(alg?) (dependency on step and trans is removed). | ||
| 15 | * Other modules have changed dependencies, might as well rework all. | ||
| 16 | * Make files smaller, do not include definition in .h, separate | ||
| 17 | data from abstract operations. | ||
| 18 | * remove cubetypes.h | ||
| 19 | * Create a module for multi-step (maybe wait?) | ||
| 20 | * Possible changes: in step solver, copy cube only if niss; add cleanup function | ||
| 21 | in solver (called by solve()) to free cube and perhaps pruning tables. | ||
| 22 | * see various TODO's in files | ||
| 23 | |||
| 24 | ### 4. More threading options | ||
| 25 | |||
| 26 | * Lazy multithread: threads are as independent as possible and only | ||
| 27 | merged at the end. Ideal when all solutions of a certain length are requested. | ||
| 28 | * (Done) Eager multithread: current implementation, branches communicate the | ||
| 29 | number and list of solutions to stop as soon as possible. Good when only one | ||
| 30 | solution of a certain depth is required. | ||
| 31 | |||
| 32 | ## Simplify steps | ||
| 33 | |||
| 34 | * Remove one type of rotation. | ||
| 35 | * Change steps to choicestep and stepalt to step (or was this already done?). | ||
| 36 | |||
| 37 | ## Add missing coordinates and steps | ||
| 38 | |||
| 39 | * Check the old file for a list. Many are missing. | ||
| 40 | * Checkers in steps.c should use coordinates. | ||
| 41 | |||
| 42 | ## Missing and new commands | ||
| 43 | |||
| 44 | * gen | ||
| 45 | * freemem | ||
| 46 | * twophase | ||
| 47 | |||
| 48 | ## Easy improvements | ||
| 49 | |||
| 50 | * Solve should re-orient the cube if centers are off | ||
| 51 | * Solve: add options for -I (inverse only) and -L (linear = normal + inverse). | ||
