Path finding; what is the most efficient way of finding a path through a small world graph?
Path finding; what is the most efficient (processor power efficient) way of finding a path (with loadbalancing) through a small world graph? What beats ACO and why does it beat it?