Let us combine what we have learnt so far about minimax and evaluation function to write a proper Tic-Tac-Toe that plays a perfect game. This game will consider all possible scenarios and makes the most optimal move. let's build some Tic-Tac-Toe that all conform to a consistent interface, and see for ourselves why interfaces are so helpful. We're going to write several different Tic-Tac-Toe scenarios, each of which will choose their moves using different strategies of varying degrees of complexity. We also want to be able to challenge your friends and family to a duel. Game scenarios: 1. Scenario that makes random moves We're going to start by writing one of the simplest ways. This option will look at the board, find all the legal moves, and return one of them at random. We'll write a function called random_option that conforms to our interface. This means that it accepts 2 arguments - a Tic-Tac-Toe board and the current player and returns the co-ordinates of a move. 2. Two human players to play against each other. 3. Tic-tac-toe unbeatable (Minimax algorithm). Name of Player Result Score 0 Al O THERE! 0 0 1/5 Round Number Number of Rounds