By editing my A* algorithm as such that:
- a tile is valid if all of its neighbours are valid (checking this N-1 deep)
I can find N wide paths, where N is odd, and my unit just follow the "center" tiles.
But what if my unit is even tiles wide?
Yes, I generate a 2 tiles wide path, and then traverse it with an offset, so my unit will walk on the overlapping edge between the 2 tiles. (maybe there is a better solution, suggestions are welcome)
But how do I find even wide paths?
(Or my whole approach is bad?)