Home > AI Searching Techniques > Breadth First Search Vs Depth First Search

Breadth First Search Vs Depth First Search

Breadth First Search Depth First Search
Advantages
Optimal solutions are always found

Multiple solutions found early

May arrive at solutions without examining much of search space
Will not go down blind alley for solution Needs little memory (only node in current path needs to be stored)
Disadvantages
If solution path is long, the whole tree must be searched up to that depth May settle for non-optimal solution
All of the tree generated must be stored in memory May explore single unfruitful path for a long time (forever if loop exists!)
  1. December 10th, 2012 at 00:14 | #1

    Quality articles is the crucial to attract the visitors to go to see the website, that’s what this web page is providing. Name is AZAEL in Daly City

  1. No trackbacks yet.