AI review Questions
Chapter 1
1. What is AI? Define AI:
2. Define in your own words: (a) intelligence, (b) artificial intelligence, (c) agent, (d) rationality, (e)
logical reasoning, (e) turning test.
3. What is meant by a class classes of problems that are intractably difficult for computers, and other
classes that are provably undecidable.
4. Discuss whether the following tasks can currently be solved by computers:
a. Playing a decent game of table tennis (Ping-Pong).
b. Driving in the center of Cairo, Egypt.
c. Driving in Victorville, California.
d. Buying a week’s worth of groceries at the market.
e. Buying a week’s worth of groceries on the Web.
f. Playing a decent game of bridge at a competitive level.
g. Discovering and proving new mathematical theorems.
h. Writing an intentionally funny story.
5. What is the difference between weak AI and strong AI?
Chapter 2-3
1. Define in your own words the following terms: agent, environment, sensor, actuator, percept, agent function,
agent program.
2. For each of the following agents, specify the sensors, actuators, and environment: microwave oven, chess
program, autonomous supply delivery plane.
3. Describe three different task environments in which the performance measure is easy to specify completely and
correctly, and three in which it is not.
4. For each of the following assertions, say whether it is true or false and support your answer with examples or
counterexamples where appropriate.
a. Anagent that senses only partial information about the state cannot be perfectly rational.
b. There exist task environments in which no pure reflex agent can behave rationally.
c. There exists a task environment in which every agent is rational.
d. The input to an agent program is the same as the input to the agent function.
e. Every agent function is implementable by some program/machine combination.
f. Suppose an agent selects its action uniformly at random from the set of possible actions. There exists a
deterministic task environment in which this agent is rational.
g. It is possible for a given agent to be perfectly rational in two distinct task environments.
h. Every agent is rational in an unobservable environment.
i. A perfectly rational poker-playing agent never loses.
j. For a simple reflex agent in a partially observable environment, a randomized policy can outperform any
deterministic policy.
k. There is a model-based reflex agent that can remember all of its percepts.
l. Suppose agent A1 is rational and agent A2 is irrational. There exists a task environment where A2’s
actual score will be greater than A1’s actual score.
5. For each of the following activities, give a PEAS description of the task environment
• Playing soccer.
• Exploring the subsurface oceans of Titan.
• Shopping for used AI books on the Internet.
• Playing a tennis match.
• Practicing tennis against a wall.
• Performing a high jump.
• Knitting a sweater.
• Bidding on an item at an auction.
6. If h1(n), h2(n), and h3(n) are all admissible A* heuristics for a given state-space search instance, then which of
*
the following are also guaranteed to be admissible heuristics? Supply proper justifications.
(1) h1(n)+h2(n)+h3(n). false
true
(2) min[h1(n),h2(n),h3(n)]
(3) max[h1(n), (h2(n)+h3(n)) ] false
7. Apply different search algorithms to fina a path from H to G, BFS, DFS, Best
First Search, Greedy, A* then compare the results. Hill climbing, IDS
Chapter 4
1) For the following CSP problem, find a coloring solution
using 3 colors R, G, B to color the given map so that there
is no 2 adjacent areas have the same color.
2) Provide a formulation for each of the following as constraint satisfaction problems:
a. Sudoku is a logic-based number placement puzzle that typically consists of a 9x9 grid divided
into nine 3x3 subgrids called "boxes." The puzzle starts with some cells already filled with
numbers, and the goal is to fill the remaining empty cells with numbers from 1 to 9, such that
each row, each column, and each box contains every number exactly once.
Variables:
● Xij, representing the value at row i and column j, where i and j range from 1 to 9.
Domain: 1-9
● D = {1, 2, 3, 4, 5, 6, 7, 8, 9}, representing the possible values for each variable.
Constraints:
1. Each variable should have a unique value within its row:
2. Each variable should have a unique value within its column:
3. Each variable should have a unique value within its 3x3 subgrid:
Initial State:
● Some variables are assigned with values based on the given puzzle. The remaining variables are
unassigned.
