The intellectual of Searching (AI)

How to solve the complicated itinerary or travel arrangement problems? Well, it would be convenient to have a system that knew your personal preferences and could find you the best possible combination of flights, car rentals and hotels.

Search problems are common in AI. A search depicts involvement of trying to find particular object from a large number of such objects. In some cases, you do not even have to consider the other objects. For an instance, no search is needed to find the number that is the product of 2 and 3. In other cases, you may need to consider and reject many objects before finding the one you are looking for. The critical problem that you may ask is there are so many possibilities to search through. For this reason, private electronic messages are often encrypted using combination of primes that are known only to the sender and receiver of the message.

Improve the chances of solving it quickly if a solution exists at all. Four- color theorem states that any map of countries can be coloured so that no two adjacent countries are coloured the same using only four colours [Appel and Haken, 1976]. If a map can be similarly colored using only three colors is NP-complete [Karp, 1972]. And if you are asked to colour a map with more than four colours, then there always exists a solution though it may take some time to find. There is also no other recourse than to consider all the other objects. E.g. search through all the employees in the company database to find one whose parents have the same initials. However, to reduce the time required to find a particular object by organizing the objects thru splitting section into subsections like blood donors into sections determined by blood type and further divide these section into subsection determined by rh factor.

In AI there are several types of search techniques:-
· Blind
· Heuristic
The objective is to solve the optimization problems which are to find the best object or at least a very good one.

As a common board game like chess are often cast as search problems.
(Source: www.itee.uq.edu.au/~janetw/Computer%20Go/go-vs-chess.pdf)