1.
In state-space, the set of actions for a given problem is expressed by the_____.
2.
In which search problem, to find the shortest path, each city must be visited once only?
3.
In the TSP problem of n cities, the time taken for traversing all cities, without having prior knowledge of the length of the minimum tour will be_______.
4.
Web Crawler is an example of______.
5.
The main function of problem-solving agent is to________.