I wrote a report on Jump Point Search on Hexagonal Grids as my research project report for the Artificial Intelligence in Games class during the Fall Semester 2014.
I also made a demo using SDL 2.0 in Visual C++. Here are some of the screenshots:
The S (Start), E(End/Goal), M(Multi-Directional Jump Point), U(Uni-Directional Jump Point).
Aditya Subramanian, 2015
Our game uses a hexagonal map. The A* algorithm we are using now wants to be optimized into a jumping point algorithm, but there is too little information on the hexagonal jumping point algorithm. Can you provide some relevant information, thank you
ReplyDelete