There is a fair bit of talk about this here. The short answer is yes.
A slightly more detailed answer would be (using A* as the example) that you are trying to find the shortest path to a set of set of points, rather than just one. You could do this by running A* 24 times which is basically just a modified version of Dijkstra’s algorithm. This tells you the path that is shortest. If two paths are tied for distance, you simply step the opposite direction you went last time. Essentially, you only need the pathing algorithms to tell you the shortest path, then you can code Terminal logic for things like alternating directions.
I’m not going into a ton of detail just because there have been a lot of posts about this already.