Thanks ! Could the “run away loop” counter be one of the reasons why my pathfinding crashes so easily? How long paths can you make in your implementation before it crashes? My A* is currently the simplest form possible, with a complete search through the closed list every time I check for the best node to select. I’m thinking of implementing a binary heap to speed things up. Have you tried different methods and found some that work better? I’d love to see what you have made, and find out how it compares to my own solution, and I really hope you are allowed to share it. In any case, you’ll be able to do so with my implementation. I’m currently in the process of moving into a new apartment, so I won’t be able to share my blueprint until probably late next week.