Sorry, an error occurred while loading the content.
Browse Groups

• ## Re: [aima-talk] Breadth-First Search

(2)
• NextPrevious
• Hi Evyn ! On page 74 3rd line .... the formula is: b+b^2+b^3+....b^d+{b^(d+1) - b} = O(b^(d+1)) so if you put b=10 and d=2 you will get, = 10 + 10^2 + (10^3 -
Message 1 of 2 , Feb 17, 2007
View Source
Hi Evyn !

On page 74 3rd line .... the formula is:

b+b^2+b^3+....b^d+{b^(d+1) - b} = O(b^(d+1))

so if you put b=10 and d=2 you will get,
=> 10 + 10^2 + (10^3 - 10)
=> 10+100+1000-10
=> 1100 :)

I think you are confused with Big-O Notation ... its for the Order of the eq/formula. Google that for more info.
To me the basic idea in this topic is the memory & time complextiy that increases with increasing the depth of BF search. O(b^d+1) actually shows this complexity in mathematical terms.

I am my self not an expert, so a percise and better explanantion from some one will be appretiated.

best regards,
Bilal Hayat Butt
BS(CS) FAST-NUCES,
Karachi,Pakistan.

evyn <demskeye@...> wrote:
Hi,

On page 74 of The Book there is a formula O(b^d+1).

The example states that b=10 and d=2, which in my mind results in 10^3
= 1000, but the example gives the result 1100.

Where is my mistake?

Regards,
Evyn

[3 ! |_ /\ |_

Don't get soaked. Take a quick peak at the forecast
with theYahoo! Search weather shortcut.

Your message has been successfully submitted and would be delivered to recipients shortly.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.