Loading ...
Sorry, an error occurred while loading the content.
Advanced Search
Author
Subject
Message
Special notice only

1 result from messages in aima-talk

Advanced Search
  • Hi all, I have a simple AI quesiton. On page 73 we read: "...breadth-first search is optimal if the path cost is nondecreasing function of the depth of the node." But on page 75 we read: "Breadth-first search is optimal when all step costs are equal...". I think both of those conditions are needed. So it seems it's better we say, Breadth-first search is optimal when both of above...
    Hesham Mar 1, 2004