Greedy descent on precomputed V*.
—nodes
- solution
—- length
- —
- plan time
- —
V*, DAVI+BWAS, and BFS plan the same scramble.
U R F U' R' F R'Greedy descent on precomputed V*.
—Batched weighted A*, heuristic from DAVI. Near-optimal.
—Breadth-first search, optimal but exponential.
—