REVIEW MATERI

10S3001-Kecerdasan Buatan

1. Define in your own words: (a) intelligence & (b) artificial intelligence.

2. Define in your own words the following terms: (a) agent, (b) agent function, (c)
agent program, (d) rationality, (e) autonomy, (f) reflex agent, (g) model-based
agent, (h) goal-based agent, (i) utility-based agent, (j) learning agent.

3. For each of the following agents, develop a PEAS description of the task
environment:
a. Automated taxi driver
b. Medical diagnosis system
c. Satellite image analysis system
d. Part-picking robot
e. Refinery controller
f. Interactive English tutor
g. Robot soccer player
h. Internet book-shopping agent
i. Autonomous Mars rover

4. For each of the following agents, characterize the environment properties

(observable, deterministic, episodic, static, discrete, agents):
a. Robot soccer player
b. Internet book-shopping agent
c. Autonomous Mars rover
d. Mathematician's theorem-proving assistant

5. Look at the following graph!

6 2
8
B G
4 2
9 3 4
A D 5 E 0
1 2
2
8
8 C 6 F
7
0
What is the order of visits of the nodes and the best path from A to E returned
by BFS, DFS and UCS, Greedy Best-First Search, and A* Search.

SGS/CERTAN/2019 1
6. Look at the following graph and heuristics!

What is the order of visits of the nodes and the best path from Denver to Sault
Ste Marie returned by BFS, DFS and UCS, Greedy Best-First Search, and A*
Search.

7. Consider the minimax tree, whose root is a max node, shown below. Assume that
children are explored left to right.

A1 A2

A11 A12 A21 A22

A111 A112 A121 A122 A211 A212 A221 A222

A1111 A1112 A1121 A1122 A1211 A1212 A1221 A1222 A2111 A2112 A2121 A2122 A2211 A2221 A2222
A2212

21 20 24 23 9 15 12 34 10 19 20 19 18 19 23 13

a. Fill in the mini-max values for each of the nodes in the tree that aren’t leaf
nodes
b. If alpha-beta pruning were run on this tree, which branches would be cut?
Mark the branches with a slash or a swirl (like a cut) and shade the leaf
nodes that don’t get explored.

8. Define in your own words the terms constraint satisfaction problem, constraint,
backtracking search, arc consistency, backjumping and min-conflicts.

9. Consider the following map.

SGS/CERTAN/2019 2
 Use the AC-3 algorithm to show that arc consistency is able to detect the
inconsistency of the partial assignment {𝑊𝐴 = 𝑟𝑒𝑑, 𝑉 = 𝑏𝑙𝑢𝑒} for the coloring
problem shown in the figure.

10. Consider this following graph. You need to color the graph (with blue, green, and
red) and do not use the same color on any two adjacent regions.

a. What are the variables, domains, and constraints in this CSP?

b. You decide to narrow down your domains by enforcing arc-consistency.
What are the remaining domains of each variable after arc consistency is
enforced.
c. If you wanted to find a solution at this point, what variables could the MRV
(minimum remaining values) ordering heuristic tell you to assign first?
d. List all solutions to this CSP or state that none exist.

SGS/CERTAN/2019 3