Write a program that can play Tic-Tac-Toe effectively. (See Section3.1.3.) To do
ID: 3564882 • Letter: W
Question
Write a program that can play Tic-Tac-Toe effectively. (See Section3.1.3.) To do this, you will need to create a game tree T, which is a tree where each node corresponds to a game configuration, which, in this case, is a representation of the tic-tac-toe board. The root node corresponds to the initial configuration. For each internal node v in T, the children of v correspond to the game states we can reach from v's game state in a single legal move for the appropriate player, A (the first player) or B (the second player). Nodes at even depths correspond to moves for A and nodes at odd depths correspond to moves for B. External nodes are either f