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

Breadth First Search Vs Depth First Search

September 4, 2010 Leave a comment Go to comments
Breadth First Search Depth First Search
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)
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 10, 2012 at 12:14 am

    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.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: