Question 82 NAT · 7.0 marks
How many test requirements are there for the edge-pair coverage? Do not write the number in
words, if your answer is 6, enter 6 but **not** six .
A published solution is not available for this question yet.
cs3003_2023T1_Q1_NA.pdf
AI: Search Methods for Problem Solving · Quiz 1 · Jan 2023
← Course papers · Start practice / exam
This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
Question 84 MSQ · 1.0 marks
Given a state space with only irreversible actions/moves, __________ .
- Depth First Search can find a solution only if the first move chosen is part of the final solution
- Depth First Search can find a solution even if the first move chosen is not part of the final solution
- Breadth First Search can find a solution only if the first move chosen is part of the final solution
- Breadth First Search can find a solution even if the first move chosen is not part of the final solution
A published solution is not available for this question yet.
Question 85 MCQ · 1.0 marks
In the Simulated Annealing algorithm, __________ .
- a population of agents collaborates in a stochastic manner to solve an optimisation problem
- a single agent generates one random neighbour and moves to it only if it is better than the current node
- a single agent generates one random neighbour and may move to it whether it is better than the current node or not
- a population of agents solves an optimization problem individually before combing the best solutions
A published solution is not available for this question yet.
Question 86 MSQ · 2.0 marks
A boat, man, lion, goat and a basket of cabbage are on the left bank of a river. The boat can carry a
man and one other item only (either a lion, goat or cabbage). When the man is not around, the
goat will eat the cabbage and the lion will eat the goat.
Model this problem as a state space search problem. A state is represented as LEFT/RIGHT, for
example,
1. NONE/BMLGC: nothing on the left bank and all are on the right bank.
2. LC/BMG: lion, cabbage are on the left bank, and a boat, man, goat are on the right bank.
3. G/BML: goat is on the left bank, and a boat, man, lion are on the right bank.
4. L/BM: lion is on the left bank, and a boat and man are on the right bank.
The first two are safe states where nothing gets eaten, the last two are unsafe states where
something gets eaten. When LGC is left alone, assume that the goat eats the cabbage, after that
the lion eats the goat, so we will have less states to handle.
A move (or action) in this state space stands for one trip across the river, where the man can go
alone in the boat or take one item along with him.
Starting from BMLGC/NONE, which of the following states (both safe and unsafe states) are
reachable in exactly 3 moves, nothing more, nothing less. Avoid repeating states like a -> b -> a.
- C/BMLG
- L/BMGC
- BMLG/C
- BMGC/L
- NONE/BML
- NONE/BMLC
A published solution is not available for this question yet.
Question 87 SHORT_TEXT · 1.0 marks
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by either two-way edges (shown as undirected edges) or one-
way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in
alphabetical order. The RemoveSeen procedure removes neighbours already present in
OPEN/CLOSED lists.
Use Manhattan distance when needed.
[[IMAGE:e4b6e3130b6dd08c_6_0]]
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN,
and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm,
the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
List the first 4 nodes (including the start node) inspected by Depth First Search. List the nodes in
the order they were inspected. If the algorithm terminates early then list the nodes inspected up
until termination.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,Z**
A published solution is not available for this question yet.
Question 88 SHORT_TEXT · 1.0 marks
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by either two-way edges (shown as undirected edges) or one-
way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in
alphabetical order. The RemoveSeen procedure removes neighbours already present in
OPEN/CLOSED lists.
Use Manhattan distance when needed.
[[IMAGE:e4b6e3130b6dd08c_6_0]]
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN,
and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm,
the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
What is the path found by Depth First Search?
Enter the path as a comma separated list of node labels.
Enter NIL if there is no path.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,G**
A published solution is not available for this question yet.
Question 89 SHORT_TEXT · 1.0 marks
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by either two-way edges (shown as undirected edges) or one-
way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in
alphabetical order. The RemoveSeen procedure removes neighbours already present in
OPEN/CLOSED lists.
Use Manhattan distance when needed.
[[IMAGE:e4b6e3130b6dd08c_6_0]]
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN,
and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm,
the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
List the first 4 nodes inspected by Breadth First Search. List the nodes in the order they were
inspected. If the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,Z**
A published solution is not available for this question yet.
Question 90 SHORT_TEXT · 2.0 marks
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by either two-way edges (shown as undirected edges) or one-
way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in
alphabetical order. The RemoveSeen procedure removes neighbours already present in
OPEN/CLOSED lists.
Use Manhattan distance when needed.
[[IMAGE:e4b6e3130b6dd08c_6_0]]
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN,
and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm,
the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
What is the path found by Breadth First Search?
Enter the path as a comma separated list of node labels.
Enter NIL if there is no path.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,G**
A published solution is not available for this question yet.
Question 91 SHORT_TEXT · 1.0 marks
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by either two-way edges (shown as undirected edges) or one-
way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in
alphabetical order. The RemoveSeen procedure removes neighbours already present in
OPEN/CLOSED lists.
Use Manhattan distance when needed.
[[IMAGE:e4b6e3130b6dd08c_6_0]]
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN,
and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm,
the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
List the first 4 nodes inspected by Best First Search. List the nodes in the order they were
inspected. If the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,Z**
A published solution is not available for this question yet.
Question 92 SHORT_TEXT · 2.0 marks
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by either two-way edges (shown as undirected edges) or one-
way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in
alphabetical order. The RemoveSeen procedure removes neighbours already present in
OPEN/CLOSED lists.
Use Manhattan distance when needed.
[[IMAGE:e4b6e3130b6dd08c_6_0]]
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN,
and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm,
the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
What is the path found by Best First Search?
Enter the path as a comma separated list of node labels.
Enter NIL if there is no path.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,G**
A published solution is not available for this question yet.
Question 93 SHORT_TEXT · 1.0 marks
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by either two-way edges (shown as undirected edges) or one-
way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in
alphabetical order. The RemoveSeen procedure removes neighbours already present in
OPEN/CLOSED lists.
Use Manhattan distance when needed.
[[IMAGE:e4b6e3130b6dd08c_6_0]]
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN,
and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm,
the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
List the first 4 nodes inspected by Hill Climbing. List the nodes in the order they were inspected. If
the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,Z**
A published solution is not available for this question yet.
Question 94 SHORT_TEXT · 1.0 marks
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by either two-way edges (shown as undirected edges) or one-
way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in
alphabetical order. The RemoveSeen procedure removes neighbours already present in
OPEN/CLOSED lists.
Use Manhattan distance when needed.
[[IMAGE:e4b6e3130b6dd08c_6_0]]
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN,
and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm,
the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
What is the path found by Hill Climbing?
Enter the path as a comma separated list of node labels.
Enter NIL if there is no path.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,G**
A published solution is not available for this question yet.
Question 95 MSQ · 1.0 marks
A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,C,...,L as the reference
(index) sequence to prepare tour representations.
[[IMAGE:e4b6e3130b6dd08c_12_1]]
Based on the above data, answer the given subquestions.
Select the valid path representations of the tour.
- L,I,F,E,B,A,C,K,H,D,J,G,L
- H,D,J,G,L,I,F,E,B,A,C,K,H
- L,I,F,E,B,A,C,K,H,D,J,G
- H,D,J,G,L,I,F,E,B,A,C,K
A published solution is not available for this question yet.
Question 96 MSQ · 1.0 marks
A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,C,...,L as the reference
(index) sequence to prepare tour representations.
[[IMAGE:e4b6e3130b6dd08c_12_1]]
Based on the above data, answer the given subquestions.
Select the valid adjacency representations of the tour.
- C,A,K,J,B,E,L,D,F,G,H,I
- B,E,A,H,F,I,J,K,L,D,C,G
- C,A,K,J,H,E,B,D,F,G,L,I
- B,G,A,H,F,I,J,E,L,D,C,K
A published solution is not available for this question yet.
Question 97 MCQ · 2.0 marks
A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,C,...,L as the reference
(index) sequence to prepare tour representations.
[[IMAGE:e4b6e3130b6dd08c_12_1]]
Based on the above data, answer the given subquestions.
Convert the path representation I,H,B,L,J,F,D,A,E,G,K,C to ordinal representation.
- 9,8,2,9,7,5,3,1,2,2,2,1
- 12,9,6,5,2,1,1,5,3,1,2,1
- 9,8,2,9,4,5,6,2,4,3,2,1
- 9,8,2,9,4,5,6,3,1,1,2,1
A published solution is not available for this question yet.
Question 98 SHORT_TEXT · 2.0 marks
A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,C,...,L as the reference
(index) sequence to prepare tour representations.
[[IMAGE:e4b6e3130b6dd08c_12_1]]
Based on the above data, answer the given subquestions.
Two tours in path representation are given below. Generate offspring using Partially Mapped
Crossover (PMX), use the locations from 5 to 8 as the mapping segment. Enter one of the child
tours in the textbox.
[[IMAGE:e4b6e3130b6dd08c_13_2]]
Enter a comma separated list of cities.
DO NOT ENTER SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
A published solution is not available for this question yet.
Question 99 SHORT_TEXT · 1.0 marks
The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided
below. Use this information to construct TSP tours.
[[IMAGE:e4b6e3130b6dd08c_15_3]]
Based on the above data, answer the given subquestions.
Use B as the starting city, construct a tour using Nearest Neighbour Heuristic. The tour is
__________ . Use alphabetical order to break ties. Enter the path representation of the tour, starting
from B and tracing the cities selected by the Nearest Neighbour Heuristic.
Enter a comma separated list of city names.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: B,X,Y,Z
A published solution is not available for this question yet.
Question 100 NAT · 1.0 marks
The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided
below. Use this information to construct TSP tours.
[[IMAGE:e4b6e3130b6dd08c_15_3]]
Based on the above data, answer the given subquestions.
What is the cost of the tour generated by Nearest Neighbour Heuristic?
Enter a number.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: 17
A published solution is not available for this question yet.
Question 101 SHORT_TEXT · 1.0 marks
The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided
below. Use this information to construct TSP tours.
[[IMAGE:e4b6e3130b6dd08c_15_3]]
Based on the above data, answer the given subquestions.
Construct a tour using Greedy Heuristic, use the sorted edge list for breaking ties, the edges
occurring early in the list wins. Enter the path representation of the tour starting from city A.
Enter a comma separated list of city names.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: A,X,Y,Z
A published solution is not available for this question yet.
Question 102 NAT · 1.0 marks
The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided
below. Use this information to construct TSP tours.
[[IMAGE:e4b6e3130b6dd08c_15_3]]
Based on the above data, answer the given subquestions.
What is the cost of the tour generated by Greedy Heuristic?
Enter a number.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: 17
A published solution is not available for this question yet.
Question 103 SHORT_TEXT · 1.0 marks
The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided
below. Use this information to construct TSP tours.
[[IMAGE:e4b6e3130b6dd08c_15_3]]
Based on the above data, answer the given subquestions.
Savings heuristic: the initial set of 6 tours with A as the fulcrum node is shown in the figure.
Identify the first two edges that will be removed and the first new edge that will be added, and
compute the savings. Enter the first edge added and the savings in the text box.
[[IMAGE:e4b6e3130b6dd08c_18_4]]
An edge from X to Y is named as XY.
Enter an edge name XY and a number as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: XY,17
A published solution is not available for this question yet.