Course: Algorithm

Populate the python code using the algorithm. Also use the screenshot of the explanation using the link mentioned. Please Answer ASAP.

File Edit Format Run Options Window Help terminal_states = {'2111ll': 0, 122111': 1, 2221': 0} O con 4 successors = { 17': ['61', '52', '43'), '61': ['511', '421'], # Complete this dictionary here 8) 9 10 def util_value (state, agent): 11 pass 12 13 def min_value (state): 14 pass 15 16 def max_value (state): 17 pass 18 19 if name main ": 20 print (util_value('7', 'MIN')) 21 # OUTPUT: 1 22 I Noon A UN def value(state): if the state is a terminal state: return the state's utility if the agent is MAX: return max-value(state) if the agent is MIN: return min-value(state) def max-value(state): initialize v = -o0 for each successor of state: v = max(v, value(successor)) return v def min-value(state): initialize v = +00 for each successor of state: v = min(v, value(successor) return v computing.dcu.ie/-humphrys/Notes/Al/adversarial.search.html Example of Minimax with exhaustive search The Game of Nim: At each move the player must divide a pile of tokens into 2 piles of different sizes. The first player who is unable to make a move loses the game. With a small number of tokens, this game is small enough for us to show an exhaustive search using Minimax. 6-1 5-2 4-3 5-1-1 4-2-1 3-2-2 3-3-1 4-1-1-1 3-2-1-1 2-2-2-1 3-1-1-1-1 2-2-1-1-1 2-1-1-1-1-1 The entire state space for a 7-token game. Image courtesy of Ralph Morelli. See Luger Fig 4.19 There are precisely 3 end states, 2 where person who starts wins, 1 where person who went and wins: 6-1 5-2 4-3 5-1-1 4-2-1 3-2-2 3-3-1 4-1-1-1 3-2-1-1 2-2-2-1 3-1-1-1-1 2-2-1-1-1 2-1-1-1-1-1 Green - Person who starts wins. Blue - Person who went and wins