This means that if you make an early mistake in choosing the children at the top of the tree, you can get into barren parts of the tree and waste time.
What you need is a way to somehow probe different parts of the final level efficiently.
See if the search algorithm given facilitates this..
On Fri, Jan 27, 2012 at 12:49 PM, Elliot Drown <firstname.lastname@example.org> wrote:
Hello,I am having some difficulty in understanding the algorithm in question 7.2, and why it might provide better performance than other search techniques. Can you clarify the algorithm and the idea behind it for me? Any additional information you can provide would be much appreciated.Thank you for your time,Elliot Drown