Home/ Questions/Q 6604307
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-25T19:08:14+00:00

I have 2D world maps that are basically Mercator-Like projections, (If you walk west

  • 0

I have 2D world maps that are basically Mercator-Like projections, (If you walk west long enough you end up east of where you started)

Question I have: Can you use A* for computing paths on these types of maps as well?

I can’t think of any reason why you couldn’t (I’m thinking that you would simply represent the edge map nodes such that the North, South, East, Wed, “border” nodes simply connected to the opposite side).

Thanks in advance, if anyone has seen something like this before or can give me a few hints I would appreciate it.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Pathfinding algorithms don’t really care about global topology of the map. The only tricky part is to get a good estimator for A* but using the 3D distance should be ok if your map is indeed a surface in a 3d space and step cost is step length.

    Your map can have all sort of strange “connections” (including for example knotted bridges) and this will not be a problem if you implement A* correctly.

    • 0