Thanks for your answer. I was searching in the server and client folder. I guess the "pathfind.h" is included in the (players character) client too. I am curious, where the player path finding is processed (client or server). I did a bit of research on A*. The algorithm itself is not so hard to understand, but the implementation of pathfinding on a "poligon map" is hard to figure out for me. How can i canculate the graph (esp. the nodes = passable polygons). For one character a poligon may be passable, for another it isnt. Some ares are passable by walking over multiple poligons (when a single poligon is to small for the character). How can i consider this in the graph calculation. How can i disign my map to make pathfinding efficient? Is it possible to use polygons with different numbers of edges for path finding? Anybody has a link or some ideas for me?

Thanks in advance,

stefanjp

PS. I hope my english is readable