Expected Minimax

Due:

11:00pm, Friday February 11, 20222

Description

Write a program named p1.py that implements the expectiminimax algorithm for a modified version of Tic-Tac-Toe. The modified game rule is that before a player’s turn a coin is flipped to determine whether the player will play an ‘X’ or an ‘O’. A player wins if the move makes three in a row based on the current marker. That is, the player is not coupled to the marker.

Turning in the Assignment

Submit a file named p1.py to the appropriate folder on D2L.

Note: if your solution is based on pseudo-code (or code) from a source other than the textbook or the lecture slides, then you must cite the source of the pseudo-code. Otherwise, you will receive a grade of zero for this assignment.