We have many searching techniques that we have discussed as uninformed but to evaluate such search strategies we talk about the following four Completeness Completeness is a guarantee of finding a solution whenever one exists.This means that if a solution exists andif you are searching technique can find that solution
Uninformed search does not have any domain knowledge. Here we are going to learn about some uniformed search strategies. Before getting into this take a review on problem solving as search, state spaces, graph searching and generic searching algorithms. We have previously learnt about the general definitions of problem solving
The main goal of Decomposable Production System is to replace a problem goal by set of sub goals .If the sub goals are solved then the main goal is also solved Explaining problems in terms of decomposable production system allows us to be indefinite about whether we are decomposing problem
Nodes labeled by component databases have sets of successor nodes each labeled by one of the components. These nodes are called AND nodes because in order to process the compound database to termination all of the component database must be processed to termination. In the above figure 2, this node
A graph search control strategy might explore many equivalent paths in producing a database containing only M’s. Redundant Paths can lead to inefficiencies because the control strategy might attempt to explore all of them; worse it might do work that is wasted ultimately in exploring paths that do not terminate.