Is there an implementation of the A* search algorithm in PLT Scheme? There's a PLaneT package for Dijkstra's algorithm, but I didn't find A*. If not, I'll probably use the dijkstra package as a starting point, unless someone has a better suggestion. --dougorleans at gmail.com