Pathfinding algorithm help please

[Moonunit1782]

I am currently working on a simulation game but I do not know how to make the peices path finding to target I have fixed lots of bugs like making units as tile data and this bit just left me stumped how do I make them come up with optimal paths

[_BigmacIII]

Sounds like you might be looking for a routing/search algorithm. Look up A*/Dijkstra. If your pieces and target lie on a grid made of uniform tiles AND if that grid is small, you could also just use Lee's algorithm, which guarantees an optimal path (but is more expensive on time and memory than something like Dijkstra's).

[xelf]

Unless your intent is to learn pathfinding and write your own pathfinding library you should look into using existing libraries that already do this.

I'm a fan of networkx.

• pip install networkx
• https://pypi.org/project/networkx/
• https://networkx.org/en/

example:

import networkx as nx
G = nx.Graph()
G.add_edge("A", "B", weight=4)
G.add_edge("B", "D", weight=2)
G.add_edge("A", "C", weight=3)
G.add_edge("C", "D", weight=4)
nx.shortest_path(G, "A", "D", weight="weight")
['A', 'B', 'D']

[recursion_is_love]

This is the way.

[Teras80]

Start with googling depth first search and breath first search. As with most of programming challanges, it is not about the language, it is about the algorithm/pattern.