aboutsummaryrefslogtreecommitdiff
path: root/TODO.md
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--TODO.md20
1 files changed, 14 insertions, 6 deletions
diff --git a/TODO.md b/TODO.md
index 91907b2..5ffef7c 100644
--- a/TODO.md
+++ b/TODO.md
@@ -17,6 +17,7 @@ It's more of a personal reminder than anything else.
17* QTM optimal solving (important: fix possible_next, which works only for HTM now) 17* QTM optimal solving (important: fix possible_next, which works only for HTM now)
18* Block-building steps (cross, roux blocks, ...) 18* Block-building steps (cross, roux blocks, ...)
19* Other common steps (LSE, ...) 19* Other common steps (LSE, ...)
20* optimal after eo (without breaking eo)
20 21
21### Improvements to currently implemented commands 22### Improvements to currently implemented commands
22* solve should re-orient first if needed and not just give up if centers are off 23* solve should re-orient first if needed and not just give up if centers are off
@@ -30,6 +31,9 @@ It's more of a personal reminder than anything else.
30### New features 31### New features
31* cleanup: translate an alg to the standard HTM moveset + reorient at the end 32* cleanup: translate an alg to the standard HTM moveset + reorient at the end
32* configurability: add an `alias` command, run config file at startup 33* configurability: add an `alias` command, run config file at startup
34* configure max ram to be used (via config file and/or command line option)
35* command to transform cube and alg
36* command notation to list available moves
33 37
34## Distribution 38## Distribution
35 39
@@ -41,9 +45,17 @@ It's more of a personal reminder than anything else.
41## Technical stuff 45## Technical stuff
42 46
43### Memory management 47### Memory management
48* free pruning table after solve is done? if so, I need to add another way
49 of doing batch solving (I don't want to re-load the tables every time);
50 for example I could add the possibility of reading scrambles from file,
51 and execute the same solve command to every line; also improve multi-threading:
52 I can just solve one scramble per thread, it's better because there is no lock.
53* alternative: just add a command "free" to free up memory; it is not
54 user friendly (who wants to manage memory manually?) but on the other hand
55 it will only be used by the few who have less than 4(?) Gb of ram.
44* Check if memory is enough for loading pruning tables; if not, abort 56* Check if memory is enough for loading pruning tables; if not, abort
45* For optimal solver: choose largest that fits in memory between 57* For optimal solver: choose largest that fits in memory between nxopt and light
46 khuge, shug6 and light 58* Remove ptable khuge
47 59
48### Performance 60### Performance
49* solve (allow_next): filter out based on base_move; only check once for each 61* solve (allow_next): filter out based on base_move; only check once for each
@@ -55,10 +67,6 @@ It's more of a personal reminder than anything else.
55* Another idea: DR + cornershtr (5Gb table); same as above, de Bondt's trick 67* Another idea: DR + cornershtr (5Gb table); same as above, de Bondt's trick
56 does not work but I can use half-turn trick 68 does not work but I can use half-turn trick
57 69
58### Coordinates, symmetries, pruning tables
59* Use pruning values mod 4 instead of mod 16 (or maybe not, I like the
60current system)
61
62### Structural changes 70### Structural changes
63* client/server architecture: run a server process in the background so that 71* client/server architecture: run a server process in the background so that
64 multiple client processess can send it queries and get results; this would 72 multiple client processess can send it queries and get results; this would

Generated with cgit - Back to sebastiano.tronto.net