diff options
| author | Sebastiano Tronto <sebastiano@tronto.net> | 2023-03-05 10:13:01 +0100 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano@tronto.net> | 2023-03-05 10:13:01 +0100 |
| commit | 87a15e960e31365698df7e06cd3e6b851e17c1a5 (patch) | |
| tree | 606a42e6251df3c24d92a2edefce723bdd103620 /TODO/new-feature-ideas.md | |
| parent | 3bfd0bb403d62bd942d1912d085ea59b156062fd (diff) | |
| download | nissy-87a15e960e31365698df7e06cd3e6b851e17c1a5.tar.gz nissy-87a15e960e31365698df7e06cd3e6b851e17c1a5.zip | |
I made a mess, but it works. Still need to implement new optimal solver.
After that, a big redesign is due.
Diffstat (limited to 'TODO/new-feature-ideas.md')
| -rw-r--r-- | TODO/new-feature-ideas.md | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/TODO/new-feature-ideas.md b/TODO/new-feature-ideas.md index b619e36..067d440 100644 --- a/TODO/new-feature-ideas.md +++ b/TODO/new-feature-ideas.md | |||
| @@ -22,9 +22,11 @@ get its own file and more details. | |||
| 22 | * Optimal solver: when asking only for one solution, scan for upper bound in | 22 | * Optimal solver: when asking only for one solution, scan for upper bound in |
| 23 | parallel using a non-optimal (but fast) solver (e.g. twophase). | 23 | parallel using a non-optimal (but fast) solver (e.g. twophase). |
| 24 | * Optimal solver: up to a small bound, try with a small pruning table. | 24 | * Optimal solver: up to a small bound, try with a small pruning table. |
| 25 | * Optimal solver: start at different depths in parallel | ||
| 25 | * Multi-step solver: make more general | 26 | * Multi-step solver: make more general |
| 26 | 27 | ||
| 27 | ## New features | 28 | ## New features |
| 28 | 29 | ||
| 30 | * Allow user to specify moveset manually (see issue \#5 on github) | ||
| 29 | * EO analysis (and also DR and HTR analysis): group similar EOs (Jay) | 31 | * EO analysis (and also DR and HTR analysis): group similar EOs (Jay) |
| 30 | * HTR "maze" analysis? | 32 | * HTR "maze" analysis? |