diff options
| author | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2021-12-14 08:27:58 +0100 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2021-12-14 08:27:58 +0100 |
| commit | e3108647e28d336e3814821d338ec3a841a8343c (patch) | |
| tree | b5fb67359fc8490d84e94d1a48732d540a48be73 /TODO.md | |
| parent | 1215648b1ba3c592bd9d97b871349673d1702e44 (diff) | |
| download | nissy-e3108647e28d336e3814821d338ec3a841a8343c.tar.gz nissy-e3108647e28d336e3814821d338ec3a841a8343c.zip | |
random attempts
Diffstat (limited to '')
| -rw-r--r-- | TODO.md | 10 |
1 files changed, 5 insertions, 5 deletions
| @@ -28,6 +28,8 @@ It's more of a personal reminder than anything else. | |||
| 28 | * solve should try up to a small bound without loading the large pruning table | 28 | * solve should try up to a small bound without loading the large pruning table |
| 29 | * drfin for HTR scrambles should try all 3 axis and pick the best solutions; | 29 | * drfin for HTR scrambles should try all 3 axis and pick the best solutions; |
| 30 | in general every step that automatically detects orientation should do this | 30 | in general every step that automatically detects orientation should do this |
| 31 | * for solve -v, solving in different orientation does not give meaningful info, | ||
| 32 | because I need to transform the alg as I go. | ||
| 31 | * for solve -v, print certain info like average branching value | 33 | * for solve -v, print certain info like average branching value |
| 32 | 34 | ||
| 33 | ### New features | 35 | ### New features |
| @@ -43,11 +45,9 @@ It's more of a personal reminder than anything else. | |||
| 43 | 45 | ||
| 44 | ## Technical stuff | 46 | ## Technical stuff |
| 45 | 47 | ||
| 46 | ## Performance (optimal solver) | 48 | ## Performance |
| 47 | * Khuge optimal solver: change direction of search when doing so leads to | 49 | * solve (allow_next): filter out based on base_move; only check once for each |
| 48 | less branching (like nxopt). Need to add some info to EstimateData or to | 50 | triple of moves; how to deal with different movesets? |
| 49 | DfsData (like last moves on inverse/other scramble) and to change some of | ||
| 50 | the logic of niss (allow for switching multiple times). | ||
| 51 | * Light optimal solver: use drud table instead of khuge, with tricks as above | 51 | * Light optimal solver: use drud table instead of khuge, with tricks as above |
| 52 | and one more trick: if the last move is 180° avoid computing inverse cube | 52 | and one more trick: if the last move is 180° avoid computing inverse cube |
| 53 | and just use previous values for all 3 axes. | 53 | and just use previous values for all 3 axes. |
