Scribd
Upload
49 views

Explain Various Blind Search Strategies. (B) What Is AI? Explain Any Four Approaches To AI

The document discusses algorithms and concepts in artificial intelligence including: the simple reflex algorithm and its diagram; examples of things AI currently cannot do such as common sense reasoning; the time and space complexity of the bidirectional search algorithm; the reverse Turing test and its requirements for the AI program; blind search strategies; definitions of static, discrete and non-episodic environments; using the A* algorithm on a map to find the lowest cost route from town A to town M.

Uploaded by

Mohammed Fadhl Albadwi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Explain Various Blind Search Strategies. (B) What Is AI? Explain Any Four Approaches To AI

The document discusses algorithms and concepts in artificial intelligence including: the simple reflex algorithm and its diagram; examples of things AI currently cannot do such as common sense reasoning; the time and space complexity of the bidirectional search algorithm; the reverse Turing test and its requirements for the AI program; blind search strategies; definitions of static, discrete and non-episodic environments; using the A* algorithm on a map to find the lowest cost route from town A to town M.

Uploaded by

Mohammed Fadhl Albadwi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

1# (a) Give the algorithm for the Simple Reflex. Draw its schematic diagram?

(b) What can AI systems NOT do yet? Give 3 examples? 2# (a) What is the complexity (in space and in time) of the Bidirectional Search Algo. (b) Explain the REVERSE TURING TEST with example. What are the requirements for the AI program here? 3# (a) Explain various blind search strategies.
(b) What is AI? Explain any four approaches to AI.

4# (a) Describe examples for Static, discrete, and Non_episodic environments (b) Consider the above map. Use the A* alg. To work out a route from town A to town M. Use the following cost functions. g(n) = The cost of each move as the distance between each town (shown on map). h(n) = The Straight Line Distance between any town and M. Shown in the table below.

State the route you would take and the cost of that route.

You might also like