Pathfinding help algorithm

Hi

I need to create a pathfinding algorithm for zombies to find a player.
i have had a look at A* pathfinding and it works in grids where as my game has ranomly placed objects and the zombie needs to find the quickest route to the player

One idea i had was to store the corners and edges, like nodes and the zombies will find a clear path to the node closest to the player
they will go from node to node.

Whats the best way to do this?

Thanks
Likdaboo

If you don’t want to use a grid then you can create a NavMesh. The concept and data structure is essentially the same but NavMesh’s tend to be sparser which means fewer nodes to traverse and you can create some shortcuts to early exit (ie - if the start and end points are on the same triangle of the NavMesh then you can just navigate to it straight away because the assumption is that the entire triangle is walkable).