My ALife project has been put on a back burner. However, I've not moved far from the subject.
I'm searching for a low-memory pathfinding algorithm. Doesn't need to be shortest path or anything. Just something that works well and can adapt if I throw random blocked paths into the mix. There's a catch, the "map" will be relatively large. The number of nodes will most likely be outrageous.
I'm planning on creating a system to store the "map" outside the actual pathfinding script. So really I just need something that's light on memory inside the algorithm; while it's doing its calculations.
I'd love to be able to use A*, but it looks to me like it'll be too memory intensive. And I'd use a "right turn only" method, but I'd like to be able to get the shortest path.
Any websites with pseudo-code even will help. Maybe someone could find me what the NASA boys used on the Mars explorer?? *giggles* Or even a console gaming resource. I think the GBA uses a tiny amount of memory.