need help with python. part $3$

class Nim:

def $\_\_$init$\_\_($self$,$ piles, stones, limit$)$:

self.piles $=$ piles

self.stones $=$ stones

self.limit $=$ limit

self.winner $=$ None

self.turns $=0$

self.cur$\_$player $=1$

self.board $=[$stones$]*$ piles

def display$($self$)$:

print$($f$"$Current Turn: $\{$self$.$turns$\}$

Current Player: $\{$self$.$cur$\_$player$\}$

Piles: $\{$self$.$board$\}")$

def copy$($self$)$:

new$\_$node $=$ Nim$($self$.$piles, self.stones, self.limit$)$

new$\_$node.winner $=$ self.winner

new$\_$node.turns $=$ self.turns

new$\_$node.cur$\_$player $=$ self.cur$\_$player

new$\_$node.board $=$ self.board.copy$()$

return new$\_$node

def check$\_$for$\_$win$($self$)$:

if all$($pile $==0$ for pile in self.board$)$:

self.winner $=$ self.cur$\_$player

def get$\_$actions$($self$)$:

actions $=[]$

for pile$\_$index, stones$\_$in$\_$pile in enumerate$($self$.$board$)$:

max$\_$stones $=$ min$($stones$\_$in$\_$pile, self.limit$)$

for stones$\_$to$\_$take in range$(1,$ max$\_$stones $+1)$:

actions.append$(($pile$\_$index, stones$\_$to$\_$take$))$

return actions

def take$\_$action$($self$,$ a$)$:

new$\_$node $=$ self.copy$()$

pile$\_$index, stones$\_$removed $=$ a

new$\_$node.board$[$pile$\_$index$]-=$ stones$\_$removed

new$\_$node.turns $+=1$

new$\_$node.cur$\_$player $=2$ if self.cur$\_$player $==1$ else $1$

new$\_$node.check$\_$for$\_$win$()$

return new$\_$node

def get$\_$state$($self$)$:

s $=0$

for i in range$($self$.$piles$)$:

s $+=$ self.board$[$i$]*($self$.$stones $+1)**$ i

return s

def heuristic$($self$,$ agent, mode$=$None$)$:

return $0$

Part $3$: Human vs AI Agents

In Part $3,$ you will actually play games against the RandomPlayer and MininmaxPlayer agents.

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

$3.$A $-$ Human vs Random

Create an instance of Nim with $3$ piles, $9$ stones per pile, and with a limit of $5$ stones per action. Then create an instance of RandomPlayer and an instance of HumanPlayer. When creating the HumanPlayer, set clear$=$False.

Then use play$\_$game$()$ to play a game against the RandomPlayer agent. Set display$\_$flags$=$'aws' when calling play$\_$game$().$ You can select which player plays first. When selecting actions, you can enter your actions as a tuple of the form $($pile$\_$index, number$\_$of$\_$stones$).$ You can also ommit the parentheses and the action will still be accepted.

You are welcome to play a few games against this agent, but your final submission should demonstrate a game in which you defeat the RandomPlayer agent. This should not require you to learn any deep strategy about playing Nim, and should not be that difficult to do$.$ If you are having difficulties defeating the random player, then I would suggest playing defensively, removing only a few stones at a time and waiting until you have an opportunity to force the random player to take the last stone.

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

$3.$B $-$ Human vs Minimax

Create an instance of Nim with $3$ piles, $9$ stones per pile, and with a limit of $5$ stones per action. Then create an instance of MinimaxPlayer with depth$=5$ and an instance of HumanPlayer. When creating the HumanPlayer, set clear$=$False.

Then use play$\_$game$()$ to play a game against the MinimaxPlayer agent. Set display$\_$flags$=$'aws' when calling play$\_$game$().$ You can select which player plays first.

You do not need to win this game $($but you are encouraged to try$).$