Pearl, J. (1984), Heuristics, Addison-Wesley. In this text, Pearl proves that for a given heuristic, A* will perform computations on fewer (or the same number of) nodes than any other graph algorithm using the same heuristic.
The pre-computation JPS(+) does is cheating because it's essentially providing a quicker-to-evaluate heuristic than A* gets to use.
So yes, I agree - the title is misleading! However, it's still a pretty cool efficiency for situations where it's applicable.
The pre-computation JPS(+) does is cheating because it's essentially providing a quicker-to-evaluate heuristic than A* gets to use.
So yes, I agree - the title is misleading! However, it's still a pretty cool efficiency for situations where it's applicable.