If it only was that simple :) since we can not solve the halting problem, pure breadth first search doesn't help. We need to find another algorithm that makes u

If it only was that simple :) since we can not solve the halting problem, pure breadth first search doesn't help. We need to find another algorithm that makes use of the tree's structure. If bfsearch could be proven to be the best algorithm, this would reduce the conjecture to the halting problem.