Question

Connect 4 is a 2 player game where each player has a set of colored tokens (red or yellow). Players take turns during which they place a single token into one of the columns of an n by m grid (where n is the number of rows and m is the number of columns. They place their token into a slot at the top of the column and it falls into the lowest unoccupied slot in that column. A player wins when they form a horizontal, vertical or diagonal chain of 4 of their color tokens. Note that a player must place a token during their turn and they cannot place a token into a row if all of its cells are occupied. Figure 1: A game of connect 4. 1. Define a State space, Action space, transition function and reward function for this problem. 2. What would be a good heuristic to use for this game and why (note that this heuristic does not have to be admissible). 3. Given the board state shown in Figure 2(red to move), use the minimax algorithm to determine the sequence of moves that 2 optimal players will make. You should show all work, the tree produced by the minimax algorithm and and indication of which child will be selected by the player at each internal node. Y IR I RR Y Y R R Y Y Figure 2: Board state for game of connect 4. Red to move.

Answer 1

- 0x e bom_parse py - C:/Users/nagar/Desktop/bom parse.py 3.8.2) Eile Edit Format Bun Options Window Help import cav det parse_bom(file): dict_bom - ) with open(file, mode=I') as csv file: for row in cav_file.readlines(): #generate List of rows item data - row.split(',') # split row by "," if item data[0] not in dict bom: #check key exist in dictionary dict bom[item_data[011 - int (item_data[1].strip('/n') #remove extra characters and convert into integer else: dict bom(item data[0]l - dict bom[item data[0]l + int(item data[1].strip('/')) #summation retum dict bom def generate_order (dict_bom, file): with open(file, newline-'') as csyfile: price_dict - 1) reader - csv. DictReader (csvfile) for TOW in reader: item_price_list - list (ow. keys())[1:] #list of keys from index 1 desired_array - (int (numeric_string) For numeric_string in item price_list] #convert string array to integer array quantity - dict_bom[row['Part Number'll Get quantity from dictionary for i in sange (len (desired_array) ) : #iterate by quantites of parts 1, 5, 10.. if desired_array[i] -- quantity: fit same quantity LE (COW [st (desized_array[i])) !- -'): fic value is not !! price_dict [row['Part Number'll - quantity . Eloat (COW [st (desired_array[i])) #multiply csv output with quantity break else: - i 16 value is '-' while(row (LY (desired_array()111 == '-'); $iterate untilget the value price = row[et: (desired_array()111 price_dict[row['Part Number'll = quantity . float (price) break el desired array(1) > quantity: 1r quntity 18 more Ir (zow[atz (desired array(1-11)1 != ''): Fget cav output of less range price_dict[row Part Number'll = quantity float (zow[atz (desized_array(1-1))) break 3 = 1-1 while (zow[atz (desired_array(3111 == '-'): Ln: 20 Col: 53 E Type here to search O e ô O @ AOD 640 ENG 17-03-2020 00:33