blob: 039f3b20c490a0d941b3a31c709ba7c8228a628b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
|
NEXT VERSION:
- solver: improve logic. check after each dr?
- add checks for sequences >255 moves
- cat!
- niss for direct DR
- prune for CO using CO+CP state
- Option: exactly N moves (or lower bound); exactly optimal?
- CO (also from EO), direct corners solve
- scramble shortner (solve + invert)
- RUF-ify
FUTURE IDEAS:
- sort before branching dfs
|
