FM-BINUS-AA-FPU-78/R4

4.

It is reported that a linear approach (Goal Stack) for the above picture
produces planning steps as follows :

UNSTACK(C,A) – PUTDOWN(C) – UNSTACK(D,B) – PUTDOWN(D) – PICKUP(A) – STACK(A,B) –

UNSTACK(A,B) – PUTDOWN(A) – PICKUP(B) – STACK(B,C) – UNSTACK(B,C) – PUTDOWN(B) –
PICKUP(C) – STACK(C,D) – PICKUP(B) – STACK(B,C) – PICKUP(A) – STACK(A,B).

Question :
Observe carefully the above micro block world and improve the result of the
aforementioned linear planning by using POP (Partial Order Planning). Draw
your answer diagramatically and show what the associated heuristic rules are
(score 15).

-- GOOD LUCK –

SEARCH PROBLEM
Consider the problem of moving a knight on a 3x4 board with start and goal states
labeled as S and G in the following graph. The letter in each node is its name and
the subscript digit is the heuristic value. All transitions have cost 1.
Make the following assumptions :
 All the algorithms do not generate paths with loops
 Nodes are selected in alphabetical order when the algorithm finds a tie
 A node is visited when that node is at the front of the search queue.

Page 1 of 3
 FM-BINUS-AA-FPU-78/R4

Questions :
Write the sequence of nodes in the order visited by the following search
strategies. Note : You may find it useful to draw the search tree corresponding
to the graph above.

a. Greedy Best First Search

b. Uniform (Least) Cost First Search
c. Heuristic A* and
d. Determine which of the above strategies is the best search strategy.
Describe your answer using a set of proper citeria such as optimality, time,
and space complexity.

1. Observe carefully the following game tree :

a. Find the possible max score () that can be obtained by a maximizing
player if MINIMAX approach is used (score 3).
b. If you are asked to perform αβ – pruning from left to right, show what nodes
will not be visited and give your justification on it (score 12).

2. Read the following presidential election paragraph thoroughly :

Page 2 of 3
 FM-BINUS-AA-FPU-78/R4

Anyone who is successful must be famous. Everyone who is famous

and loved will be elected. Jokowi is loved and successful. Everyone
who is elected becomes the President.

Questions :
a). Convert the above paragraph into FOPL representation. You are allowed to
add some relevant sentences if you think it is neccessary (score 8).
b). Convert the FOPL representation obtained in (a) into CNF (score 8).
c). Proof by resolution that Jokowi becomes the President (score 4).

Page 3 of 3