They don't understand the current Ordo, so it's sidegrade for the AI.
I'm not sure how exactly the path finder was implemented (Google AI is very confused), but here's my idea to find the shortest path from A
0 to B:
- Find all tiles that can restore moves within reach (A1, A2, ...)
- Will need to do this recursively since you can use each of them once
- Find the shortest path from each Ai to B, without considering move restores.
- Get the one with the lowest cost (An to B). Our desired path should be A0 → An → B.