Bidirectional search-artificial intelligence, Basic Computer Science

Bidirectional Search-Artificial intelligence:

We've concentrated so far on searches where the point of the search is to search a solution, not the path to the solution. In another search, we know the solution, and we know the first state, but we don't know how to get from one to the other, and the point of the search is to search a path. In these cases, in addition to searching forward from the first state, we may sometimes also search backwards from the solution. This is known a bidirectional search.

For example, suppose the 8-puzzle game in the diagram below, where the point of the game is to move the pieces around so that they are set in the right hand diagram. It's likely that in the search for the solution to this puzzle (given an arbitrary starting state), you must start off by moving some of the pieces around to get some of them in their end positions. Then, as you got nearer to the solution state, you must work backwards: by asking yourself, how can I get from the solution to where I am at the moment, then reversing the seek path. In this type of case, you've used a bidirectional search.

128_Bidirectional Search.png

Bidirectional search has the advantage that search conduct in both directions is only required to go to a depth half that of usual searches, and this may often lead to a strong reduction in the number of paths looked at. For example, if we were searching for a path from one town to other through at mainly six other towns, we only need to look for a journey through 3 towns from both directions, which is easy to do, compare to searching every paths through 6 towns in a normal search.

Posted Date: 10/2/2012 2:33:51 AM | Location : United States







Related Discussions:- Bidirectional search-artificial intelligence, Assignment Help, Ask Question on Bidirectional search-artificial intelligence, Get Answer, Expert's Help, Bidirectional search-artificial intelligence Discussions

Write discussion on Bidirectional search-artificial intelligence
Your posts are moderated
Related Questions
#question.a tree has 0 off springs at each node. if it had a label L, what will be the maximum number of nodes that the tree can have. only an expression involving the number of no

They are used to reduce or enlarge the content of the counters. DEC INC DEC INSTRUCTION Idea: To diminish the operator. Syntax: DEC destiny This action subtracts 1 from the destiny

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i

explain ipx for lan and spx

Selects among the processes in memory which are ready to execute & allocates the CPU to one of them CPU scheduling decisions can be taken place when a process: A. Terminates B. Swi

Execute a command in operating system: In order to execute a command OS does the following steps:   It accepts a command from a user through mouse clicks or from t

The role of array processor

Assess the reliability of data gathered via paid Internet users. Describe and assess the evaluation method being used by the testing company, i.e., nonvisual and verbal recording o

SOCIAL NETWORKING:  A social network is a network of individuals which have some sort of interdependence on each other. This interdependence may be in the form of friendship,

A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''''''''a''''''''-'''''''