3.
How is minmax algorithm used in game search? Consider state space is defined by a collection of pairs like (A, B) representing paths between states A and B. Construct state space for following and use a minmax algorithm. (A, B), (A, C), (B, D), (D, E), (C, F), (C, G), (D, H), (D, I), (E, J), (F, K), (F, L), (G, M), (G, N). The utilities for states H, I, J, K, L, M, N are 1, 3, 2, 6, 3, 4, 1 respectively. [5]