Bidirectional search, Computer Engineering

Bidirectional Search:

We've concentrated so far on the searches where the point of view for the search is to find a solution, but not the path to the solution. Like any other searches, we know  and notice the solution, and we know the initial state, but we don't know how to get from one to the other, and the point of view the search is to find a path in the given problem. As in these cases, there in addition to searching forward from the initial state, we can sometimes also search backwards from this kind of problem's solution. This is known as the bidirectional search. 

For example we easily understand, consider the 8-puzzle game in this diagram below, where the main point of the game is just to move the pieces around so by that they are arranged in the right hand diagram. It just that in the search for the solution to this puzzle (the given an arbitrary starting to state); you might start off by moving several of the pieces around to get several of them in their end positions in manner. Then, as you reached closer to the solution state, you might that it work backwards: asking yourself, why and how I can get from the solution to where I am stand at the moment, then reversing the main search path. In this issue yes, you've used a bidirectional search. 

2495_Bidirectional Search.png

Bidirectional search has the main advantage that search can be done in both directions is only required to go for a depth half that is may be of normal searches, and this can often lead to a drastic cut in the number of paths looked at same like this. For this instance, if we were just looking for a path that is come from one town and goes to another through at most six other towns, we can only have to look for the journey through three towns from both directions, we know that which is fairly easy to do, compare to searching all paths through six towns in a normal way of search. 

Unfortunately, it is just often difficult to apply for a bidirectional search because (a) we don't actually sense the solution, only a description of it (b) there may be too many solutions, and we have to choose a few to work backwards from (c) we can't reverse our operators to work backwards from the solution and (d) we have to record all the paths from both sides to check if any two meet at the same point  - this may take up a lot of memory, and considering through both sets repeatedly could take up more computing time.

Posted Date: 1/9/2013 7:23:12 AM | Location : United States







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

Write discussion on Bidirectional search
Your posts are moderated
Related Questions
explain about relations

What is assembly language? Assembly language : It is a family of low-level language for microprocessors, programming computers, microcontrollers etc. All are implement a symbo

Interrupt Signal Interconnection Network (ISIN) When a processor needs to send an interruption to another processor, then this interrupt initial goes to ISIN, through which it

How do you save data in BDC tables? The data in BDC tables is saved by using the field name 'BDC_OKCODE' and field value of '/11'.

what is bitmap and pixmap

Stack unwinding in C++ is a process during exception handling when the destructor is known for all local objects the place where the exception was thrown and where it is caught.

Main script section ("Sub Main .. End Sub) and function bodies should fit within an A4-page (approx. two monitor-pages). If the code doesn't fit it is a candidate to do more decoup

Which interface converts SQL requirements in the SAP development system to those of the database? Database Interface converts SQL in the SAP.

Q. Characteristics of extreme unencoded micro-instructions? 1. Two sources can be attached by respective control signals to a single destination; though only one of these sourc

It's not trivial to execute nested functions such that they have the proper access to local variables in the having function(s), so they were deliberately left out of C as a simpli