Posted on 2003-10-27
I'm encountering with a graph searching problem that is best to be solved by Breadth-First Search (at least thats what i was told). This problem is about searching for a target in a 2D environment with shortest possible path. The environment is the input to the porgram and the output is a sequence of commands that dictate the shortest path between starting point and the target. Please inspire me experts!