Can anyone suggest me how to solve bypass in one cell in moving soldiers around in grid game?
===

Can anyone suggest me how to solve bypass problem in moving soldiers around ? I have grid liek game ( rows=200, columns=200 ) and I can send soldier around and find path with A* algorithm ( one soldier occupy approximately on quarter of cell ). My problem is when I send two soldiers on trip on map and they can cross during the trip in on cell, how to by pass them ? At the moment they acting like ghosts and pass one through other. Did anyone have same task in past ?