Artificial Intelligence20815 marksNumerical: Minimax algorithm state spaceMini-max Search
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),
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]
Edges (parent, child): (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) Terminal utilities: H=1, I=3, J=2, K=6, L=3, M=4, N=1 Minimax is used for two-player, zero-sum adversarial games. One player (MAX) tries to maximize the final utility; the opponent (MI...