Department of Computer Science and Software Engineering
School of Computing and Information Systems
Copyright By PowCoder代写 加微信 powcoder
COMP30024 Artificial Intelligence
Feedback Quiz
The aim of this quiz is to give you feedback on how well you have understood some of
the key concepts taught in the first few weeks of the course.
This quiz does NOT count towards your assessment. It is completely optional.
Instructions: You should do this as a closed book quiz, to test your knowledge.
We will discuss the answers together in the second half of the lecture.
Feedback Quiz
Question 1
Consider the search space shown in Figure 1-1. The search space has one start state (S),
and 2 possible goal states (G1 and G2). The directed arcs correspond to possible
operators that lead to successor states. The cost of each operator is shown next to the
corresponding arc, e.g., the cost of moving from S to A is 6. A heuristic value is shown in
brackets for each state, which is an estimate of the path cost from that state to the nearest
goal, e.g., the heuristic value of state A is 4.
For each of the following search strategies, write down:
(a) the first goal state reached using that search strategy
(b) the sequence of states expanded.
A state is expanded when it is removed from the queue of nodes used by the search
algorithm, and its successor nodes are generated (if any).
When inserting nodes into the queue, if there are two or more nodes that are equivalent
using the queuing policy for the given search strategy, then you should insert these nodes
in increasing alphanumeric order.
(i) Breadth-first search
(a) Goal state reached:
(b) Sequence of states expanded:
(ii) Uniform cost search
(a) Goal state reached:
(b) Sequence of states expanded:
(iii) Greedy search
(a) Goal state reached:
(b) Sequence of states expanded:
(iv) Is the heuristic admissible? Why?
B (5) C (2)
Figure 1-1
Feedback Quiz
Question 2
Consider the 3-ply game tree shown in Figure 2-1. Each terminal node has an
associated value as shown.
(a) What is the minimax value of the root node of this tree?
(b) Would node X be pruned by alpha-beta search?
(c) Would node Y be pruned by alpha-beta search?
Question 3
How would you characterize the environment type for the game in the project?
(write “yes” or “no” for each property)
Observable?
Deterministic?
Figure 2-1
-3 2 8 4 6 -1 7 0
Feedback Quiz
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com