Hmm, A-star is supposed to be optimal. Can you describe how you tricked it? Edit: never mind, I didn't see all the options. Using Manhattan distance when diago

Hmm, A-star is supposed to be optimal. Can you describe how you tricked it? Edit: never mind, I didn't see all the options. Using Manhattan distance when diagonal moves are allowed causes the heuristic to be invalid, so you can make it take an L path instead of a diagonal if the diagonal path would force it to move slightly backwards at the start.