COS3751 - Assignment 2 2023

Question 1
1.1
A utility function provides an indication of the apparent numerical value of a state
(either terminal or non-terminal) s for player p. It is used to find the best available
move for a player.

1.2
No,
Agents can still get the ideal strategy when playing without all the information.
This means the ideal strategy includes the notion of limited information, however,
an agent that has perfect information will most likely outperform and agent that has
limited/imperfect information for the same problem.

1.3
Forward pruning means that some nodes are pruned without even considering them.
Beam search [others are also considered] only considers a sample of the best moves.
at each ply, but this may lead to the best move being pruned away.

1.4
Only if we prune. Otherwise minimax is an exhaustive search (for the parameters
such as depth – plys – it is configured for) and node orders do not matter



Question 2
2.1
A = -7
B = -7
C = -8
D = -7
E=0
F=5
G = -8
H = -3
I=3

2.2
B
The utility value for MAX for move B is higher than that of move C

2.3
A = (-7, ∞)
B = (-∞, -7)
C = (-7, ∞ )
D = (-7, ∞)
E = (-∞, -7)
F = (-∞, -7)
G = (-7, ∞)