I've implemented a JPS path finder, but my short tests show it isn't performing nearly as well as I expected -- actually noticeably worse than my A*. I think this is because of how the jumps are generating/looking up nodes. Perhaps some kind of intermediate Point2 implementation may be necessary in order to avoid calling MapGraph#getOrCreate(int,int) (thus avoiding the cost of generating those graph nodes until they are actually resolved by the algorithm).
I've implemented a JPS path finder, but my short tests show it isn't performing nearly as well as I expected -- actually noticeably worse than my A*. I think this is because of how the jumps are generating/looking up nodes. Perhaps some kind of intermediate
Point2implementation may be necessary in order to avoid callingMapGraph#getOrCreate(int,int)(thus avoiding the cost of generating those graph nodes until they are actually resolved by the algorithm).Originally posted by @collinsmith in https://github.com/collinsmith/riiablo/issues/63#issuecomment-557847514