[stefanhendriks]

i dunno about dijkstra exactly. I thought that was by bi-directional searching? Or am i messing stuff up now?

A* always has an heuristic, if it does not have one, it would not create a path at all. So i guess a 'non heuristic' one is meant to be 'find the best node thats gets closer to goal'...