Greedy on V*. Always finds the shortest solve in zero search.
—nodes
- solution
—- length
- —
- plan time
- —
Race
V*, DAVI+BWAS, and uninformed BFS plan the same scramble.
Scramble
U R F U' R' F R'Learned heuristic from DeepCubeA-style training, batched A* search.
—nodes
- solution
—- length
- —
- plan time
- —
Breadth-first search from the scrambled state. Optimal length, no heuristic.
—nodes
- solution
—- length
- —
- plan time
- —