PREV INDEX NEXT

Author: Unknown
Subject: Depth first search vs Breadth first search
Date: Monday, 20 Apr 2020, 20:27:38

I was trying to prove that all paths from the INITIAL string to GOAL from Nine20 must have the same length given there is at least one path, but it doesn't appear to be true, correct?

Is this why we had to use breadth first search when trying to find a solution since depth-first search could have resulted in a  solution that is longer than the shortest one but still less than MAXSTEPS?

Is there an upper bound as to how different the lengths any two paths from INITIAL to GOAL can be by the way? That is, of course, assuming there is a path.
PREV INDEX NEXT