Hi,
I am currently researching path finding. I am aware of the a-star algorithm and I have implemented it myself years ago. While it's perfectly suited for gridded system, I want to know if there are also algorithms that can do path finding without a grid, e. g. by doing raycasting and finding obstacles in a 3D environment.
I played company of heroes a lot and I never had the feeling that there is an actual grid underneath (correct me if I am wrong) since you could really freely move your units.