I am new to game development and I am developing my first "Tower Defense"-type game.
I need a pathfinding algorithm to place my towers and to move enemies.
- For tower placement case: I want the algorithm to run from entry to exit so that if it passes, the user can place tower and if fails user can't.
- For the enemy case: it should help multiple enemies to find their shortest path by running it for each enemy's current position to exit.
Searching about path finding I have found some algorithms like Floyd–Warshall, A*, Breadth First, Dijkstra's and some others. Some answers give priority to Floyd's over it for path finding with multiple enemies. So what do you suggest that I use for my case?
My grid size is 17x23 and my game would have multiple entry and exit points in future. I am using the Unity game engine and scripting in C#.