GAMES Two-level game tree with leaf values A=54, B=90, C=56, D=78, E=58, F=67, G=30, H=24, I=72 Based on the above data, answer the given subquestions Select the correct statements about the Alpha-Beta algorithm.

(A) Alpha-Cut prunes MAX nodes.

(B) Alpha-Cut is made by a MIN node.

(D) Beta-Cut is made by a MAX node.

GAMES Two-level game tree with leaf values A=54, B=90, C=56, D=78, E=58, F=67, G=30, H=24, I=72 Based on the above data, answer the given subquestions Select the condition that triggers an Alpha-Cut.

(B) Alpha \< eval(child) \< Beta

AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments. PREDICATES armEmpty The arm is not holding any block, it is empty. holding(X) The arm is holding X. onTable(X) X is on the table. clear(X) X has nothing above it, it is clear. on(X,Y) X is directly placed on Y. OPERATORS Pickup(X): pick up X from the table. Preconditions: { armEmpty, clear(X), onTable(X) } Add Effects : { holding(X) } Del Effects : { armEmpty, onTable(X) } Putdown(X): place X on the table. Preconditions: { holding(X) } Add Effects : { armEmpty, onTable(X) } Del Effects : { holding(X) } Unstack(X,Y): pick up X that is directly sitting on Y. Preconditions: { armEmpty, clear(X), on(X,Y) } Add Effects : { clear(Y), holding(X) } Del Effects : { armempty, on(X,Y) } Stack(X,Y): place X directly on top of Y. Preconditions: { holding(X), clear(Y) } Add Effects : { armEmpty, on(X,Y) } Del Effects : { holding(X), clear(Y) } Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.\ Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.\ A planning problem is given below, find a …

(C) on(G,E); on(E,M); { on(E,M), on(G,E) }; END

(A) { on(E,M), on(G,E) }; on(E,M); on(G,E); END

(B) { on(E,M), on(G,E) }; on(G,E); on(E,M); END

(D) on(E,M); on(G,E); { on(E,M), on(G,E) }; END

AI Search Methods Quiz 2 PYQ May 2025: 3 Aug 2025 · IITM BS

Question 1

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

Does the Breadth First Search find the path to the goal?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

A
Yes

Question 1 on its own page

Question 2

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

Does the Best First Search find the path to the goal?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

A
Yes

Question 2 on its own page

Question 3

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

Does the Branch and Bound algorithm find the path to the goal?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

B
No

Question 3 on its own page

Question 4

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

B
No

Question 4 on its own page

Question 5

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

A
Yes

Question 5 on its own page

Question 6

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

Is the heuristic admissible in the given state space?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

A
Yes

Question 6 on its own page

Question 7

+1 markNumerical answer

TSP
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.

A	B:30	C:32	D:68	E:70
B	A:30	C:36	E:40	D:44
C	A:32	B:36	D:50	E:72
D	E:42	B:44	C:50	A:68
E	B:40	D:42	A:70	C:72

AB	AC	BC	BE	DE
30	32	36	40	42

BD	CD	AD	AE	CE
44	50	68	70	72

The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.

Attention: A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible before computing the lower bound.

What is the lower bound on the cost of the tour as per the TSP BnB algorithm discussed in class? Enter a natural number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 17

Show answer

Correct answer: 182

Question 7 on its own page

Question 8

+1 markWritten answer

TSP
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.

A	B:30	C:32	D:68	E:70
B	A:30	C:36	E:40	D:44
C	A:32	B:36	D:50	E:72
D	E:42	B:44	C:50	A:68
E	B:40	D:42	A:70	C:72

AB	AC	BC	BE	DE
30	32	36	40	42

BD	CD	AD	AE	CE
44	50	68	70	72

The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.

Attention: A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible before computing the lower bound.

What is the first segment (XY) selected for refining S0?
Enter edge label XY
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: XY

Show answer

Correct answer: AB or BA

Question 8 on its own page

Question 9

+1 markNumerical answer

TSP
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.

A	B:30	C:32	D:68	E:70
B	A:30	C:36	E:40	D:44
C	A:32	B:36	D:50	E:72
D	E:42	B:44	C:50	A:68
E	B:40	D:42	A:70	C:72

AB	AC	BC	BE	DE
30	32	36	40	42

BD	CD	AD	AE	CE
44	50	68	70	72

The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.

Attention: A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible before computing the lower bound.

Show answer

Correct answer: 206

Question 9 on its own page

Question 10

+1 markNumerical answer

TSP
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.

A	B:30	C:32	D:68	E:70
B	A:30	C:36	E:40	D:44
C	A:32	B:36	D:50	E:72
D	E:42	B:44	C:50	A:68
E	B:40	D:42	A:70	C:72

AB	AC	BC	BE	DE
30	32	36	40	42

BD	CD	AD	AE	CE
44	50	68	70	72

The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.

Attention: A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible before computing the lower bound.

How many tours are represented in the node rs?
Enter a natural number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42

Show answer

Correct answer: 0

Question 10 on its own page

Question 11

+1 markNumerical answer

TSP
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.

A	B:30	C:32	D:68	E:70
B	A:30	C:36	E:40	D:44
C	A:32	B:36	D:50	E:72
D	E:42	B:44	C:50	A:68
E	B:40	D:42	A:70	C:72

AB	AC	BC	BE	DE
30	32	36	40	42

BD	CD	AD	AE	CE
44	50	68	70	72

The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.

Attention: A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible before computing the lower bound.

Show answer

Correct answer: 320

Question 11 on its own page

Question 12

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions

List the horizon nodes in the best strategy.
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z

Show answer

Correct answer: D,E,F

Question 12 on its own page

Question 13

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions

List the horizon nodes pruned by Alpha-Beta algorithm.
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z

Show answer

Correct answer: H,I

Question 13 on its own page

Question 14

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions

Show answer

Correct answer: A,D,G

Question 14 on its own page

Question 15

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions

Solve the game tree using SSS* algorithm. List the horizon nodes (not in the initial cluster) that are assigned SOLVED status.

Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z

Show answer

Correct answer: E,F

Question 15 on its own page

Question 16

+1 markOne or more correct options

GAMES

Based on the above data, answer the given subquestions

Select the correct statements about the Alpha-Beta algorithm.

Select all that apply.

A
Alpha-Cut prunes MAX nodes.
B
Alpha-Cut is made by a MIN node.
C
Beta-Cut prunes MIN nodes.
D
Beta-Cut is made by a MAX node.

Show answer

Correct answers

A
Alpha-Cut prunes MAX nodes.
B
Alpha-Cut is made by a MIN node.
C
Beta-Cut prunes MIN nodes.
D
Beta-Cut is made by a MAX node.

Question 16 on its own page

Question 17

+1 markOne correct option

GAMES

Based on the above data, answer the given subquestions

Select the condition that triggers an Alpha-Cut.

A
eval(child) <= Alpha
B
Alpha < eval(child) < Beta
C
Beta <= eval(child)
D
Cannot be determined

Show answer

Correct answer

A
eval(child) <= Alpha

Question 17 on its own page

Question 18

+1 markOne correct option

GAMES

Based on the above data, answer the given subquestions

For a 2-ply game tree with branching factor 3, the number of strategies for MAX-player is __________ .

A
2
B
3
C
2^2
D
2^3
E
3^2
F
3^3

Show answer

Correct answer

B
3

Question 18 on its own page

Question 19

+1 markNumerical answer

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.

text

1PREDICATES
2
3armEmpty         The arm is not holding any block, it is empty.
4holding(X)       The arm is holding X.
5onTable(X)       X is on the table.
6clear(X)         X has nothing above it, it is clear.
7on(X,Y)          X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.

Based on the above data, answer the given subquestions

What is the length of the optimal plan? Enter the number of actions in the optimal plan. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42

Show answer

Correct answer: 6

Question 19 on its own page

Question 20

+1 markOne or more correct options

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.

text

1PREDICATES
2
3armEmpty         The arm is not holding any block, it is empty.
4holding(X)       The arm is holding X.
5onTable(X)       X is on the table.
6clear(X)         X has nothing above it, it is clear.
7on(X,Y)          X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.

Based on the above data, answer the given subquestions

Which of the following are applicable actions for the given planning problem?

Select all that apply.

A
Pickup(D)
B
Pickup(G)
C
Pickup(M)
D
Unstack(C,M)
E
Unstack(E,D)

Show answer

Correct answers

B
Pickup(G)
D
Unstack(C,M)
E
Unstack(E,D)

Question 20 on its own page

Question 21

+1 markOne or more correct options

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.

text

1PREDICATES
2
3armEmpty         The arm is not holding any block, it is empty.
4holding(X)       The arm is holding X.
5onTable(X)       X is on the table.
6clear(X)         X has nothing above it, it is clear.
7on(X,Y)          X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.

Based on the above data, answer the given subquestions

Which of the following are relevant actions for the given planning problem?

Select all that apply.

A
Pickup(G)
B
Stack(E,M)
C
Stack(G,E)
D
Unstack(C,M)
E
Unstack(E,D)

Show answer

Correct answers

B
Stack(E,M)
C
Stack(G,E)

Question 21 on its own page

Question 22

+1 markOne correct option

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.

text

1PREDICATES
2
3armEmpty         The arm is not holding any block, it is empty.
4holding(X)       The arm is holding X.
5onTable(X)       X is on the table.
6clear(X)         X has nothing above it, it is clear.
7on(X,Y)          X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.

Based on the above data, answer the given subquestions

Which of the following can be pushed as the first three elements onto the stack by the Goal Stack Planning algorithm? In the representation below the stack has a bottom on the right marked by the entry END. Use appropriate tie-breakers listed in the main data.

A
{ on(E,M), on(G,E) }; on(E,M); on(G,E); END
B
{ on(E,M), on(G,E) }; on(G,E); on(E,M); END
C
on(G,E); on(E,M); { on(E,M), on(G,E) }; END
D
on(E,M); on(G,E); { on(E,M), on(G,E) }; END

Show answer

Correct answer

C
on(G,E); on(E,M); { on(E,M), on(G,E) }; END

Question 22 on its own page

Question 23

+1 markOne correct option

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.

text

1PREDICATES
2
3armEmpty         The arm is not holding any block, it is empty.
4holding(X)       The arm is holding X.
5onTable(X)       X is on the table.
6clear(X)         X has nothing above it, it is clear.
7on(X,Y)          X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.

Based on the above data, answer the given subquestions

For the subgoal ordering given in the goal description (and using the given tie breaking rules), which of the following is the first action popped out of the stack in Goal Stack Planning?

A
Pickup(G)
B
Stack(G,E)
C
Unstack(E,D)
D
Unstack(C,M)

Show answer

Correct answer

A
Pickup(G)

Question 23 on its own page

Question 24

+1 markOne correct option

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.

text

1PREDICATES
2
3armEmpty         The arm is not holding any block, it is empty.
4holding(X)       The arm is holding X.
5onTable(X)       X is on the table.
6clear(X)         X has nothing above it, it is clear.
7on(X,Y)          X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.

Based on the above data, answer the given subquestions

For the subgoal ordering given in the goal description (and using the given tie breaking rules), does the Goal Stack Planning algorithm find an optimal plan?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

B
No

Question 24 on its own page

Question 25

+1 markOne correct option

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.

text

1PREDICATES
2
3armEmpty         The arm is not holding any block, it is empty.
4holding(X)       The arm is holding X.
5onTable(X)       X is on the table.
6clear(X)         X has nothing above it, it is clear.
7on(X,Y)          X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.

Based on the above data, answer the given subquestions

If the subgoals in the goal description are swapped places then does the Goal Stack Planning algorithm find an optimal plan?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

A
Yes

Question 25 on its own page