Home/ Questions/Q 712361
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-14T04:50:22+00:00

I’m having trouble finding the right pathfinding algorithm for some AI I’m working on.

  • 0

I’m having trouble finding the right pathfinding algorithm for some AI I’m working on.

I have players on a pitch, moving around freely (not stuck to a grid), but they are confined to moving in 8 directions (N NE E etc.)

I was working on using A*, and a graph for this. But I realised, every node on the graph is equally far apart, and all the edges have the same weight – since the pitch is rectangular. And the number of nodes is enormous (being a large pitch, with them able to move between 1 pixel and another)

I figured there must be another algorithm, optimised for this sort of thing?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I would break the pitch down into 10×10 pixel grid. Your routing does not have to be as finely grained as the rest of your system and it makes the algorithm take up far less memory.

    As Chris suggests above, choosing the right heuristic is the key to getting the algorithm working right for you.

    • 0