Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Just trying to get my head around this algorithm. Consider a small tree with a root node and 3 children. With A being root and B C D being it’s children and then root B having child E. If the goal was D, do we stop as soon as the root is expanded or do we keep traversing down to E, come back up, then try and expand C before we go to D?
You check every leaf in the tree taking all the paths as deep as possible. So if you have an order on B C D (i.e. you got them in this order from enumerating A’s leaves) you’ll go A B E first, then C and the last will be D.
This is usually done by having a special structure to store unattended leaves.