Thursday, 3 April 2008

Different Search Strategies

Search Algorithms are used in a large number of situations depending on different problems like artificial intelligence, problem solving planning or to parse sentences in English.This helps us to solve a large numbers of problems using different search strategies easily.*
Different Search Algorithms Or Strategies are used to find shortest distance.
Strategies are differentiated by the way nodes are being expanded. Different search strategies have different way of expanding nodes like Breadth First search expands nodes level by level,Depth First Search goes deeper at each step, best first search uses heuristic function to explore nodes etc.Different Search Strategies are:
1. Depth First Search
2. Breadth First Search
3. DJkstras
4. Best First Search
5. A*
6. Hill Climbing


Please click on the right hand side algorithms to understand more in detail.
*Stevens, L. (1985). Artificial Intelligence, the search of perfect machine. United States of America: Hyden Book Company 1985.p 111-112