When would best first search be worse than a simple breadth first search?

When you don''t know how to implement it coz you didn''t do your homework.
Why study A.I. (or computing for that matter) if you''re obviously not all that interested in it?

Everyhitng you post is about your homework. Why don''t you sit down, read your book, then answer the question your self? If you have not figured it out by now, no one is going to do your homework.


Moral Of The Story:
Do your own damn homework!


-UltimaX-

"You wished for a white christmas... Now go shovel your wishes!"

Best-first searches are useful when your solution space has fractional dimensions. For instance, a FPS where you''re trying to get to safety, but you can''t run south because there''s wolves coming after you from that direction. Or when you''re trying to jump to get the last can of sardines off a high shelf, but gravity keeps pulling you down. In this case, the sardines themselves are the "goal", but a breadth-first search for them would cause massive problems, as you''d end up eating everything else in the kitchen (on lower shelves) before you got to the sardines. And by then the wolves would have eaten you. It all comes down to the food chain, really. And unless you entice the wolves with the promise of sardines if they''ll give you a leg up to the shelf, you''re dogmeat. It''s a cruel, cruel world, looking_nice. The bastards''ll get you every time. What was your question?

How appropriate. You fight like a cow.

Damn dude!
That''s gotta be the best symbolical answer I''ve ever read!

thank you very much Sneftel. so nice of u

quote: Original post by looking_nice
thank you very much Sneftel. so nice of u

Indeed. I''m a real boyscout.

(NOBODY SAY ANYTHING )

How appropriate. You fight like a cow.