aboutsummaryrefslogtreecommitdiff
path: root/TODO
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano.tronto@gmail.com>2020-06-21 23:06:50 +0200
committerSebastiano Tronto <sebastiano.tronto@gmail.com>2020-06-21 23:06:50 +0200
commit73eae801076b4c17d6b3d2d23db9e39938b01586 (patch)
treed15edb3d9c4b4003e227c1ad4092b3b94c9fdcdd /TODO
parentdcc8def9afd77bcc120f80f85d0f3b349bf7143a (diff)
downloadnissy-73eae801076b4c17d6b3d2d23db9e39938b01586.tar.gz
nissy-73eae801076b4c17d6b3d2d23db9e39938b01586.zip
Initial commit
Diffstat (limited to 'TODO')
-rw-r--r--TODO13
1 files changed, 0 insertions, 13 deletions
diff --git a/TODO b/TODO
deleted file mode 100644
index 039f3b2..0000000
--- a/TODO
+++ /dev/null
@@ -1,13 +0,0 @@
1NEXT VERSION:
2- solver: improve logic. check after each dr?
3- add checks for sequences >255 moves
4- cat!
5- niss for direct DR
6 - prune for CO using CO+CP state
7- Option: exactly N moves (or lower bound); exactly optimal?
8- CO (also from EO), direct corners solve
9- scramble shortner (solve + invert)
10- RUF-ify
11
12FUTURE IDEAS:
13- sort before branching dfs

Generated with cgit - Back to sebastiano.tronto.net