need help with take action method:

my code so far:

import numpy as np

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

Take Action Method

The Nim class should have a take$\_$action$()$ method that can be used to apply a selected action to the game.

The header for take$\_$actions$()$ is shown below.

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

This self parameter refers to the instance of Nim from which the method is being called and the a parameter is

an action tuple of the form $($pile$\_$index, stones$\_$removed$).$

The method should perform the following tasks:

$1.$ Use the copy$()$ method of self to create a copy of the current instance. Name the copy new$\_$node.

$2.$ Update the board attribute of new$\_$node to remove stones from one of the piles. The correct pile and

the number of stones are indicated by the action, a$.$

$3.$ Increment the number of turns that have been taken by $1$ for new$\_$node.

$4.$ Switch the current player for new$\_$node from $1$ to $2,$ or from $2$ to $1.$

$5.$ Call the check$\_$for$\_$win$()$ method of new$\_$node to see if the current player has won.

$6.$ Return new$\_$node.