Python: 2048 games Board = list[list[str]]# Checks whether a given board has any# possible move left. If no more moves,# return True. Otherwise return False.def isGameOver(board: Board) - bool:return False# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Up' key.def doKeyUp(board: Board) - tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Down' key.def doKeyDown(board: Board) - tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Left' key.def doKeyLeft(board: Board) - tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Right' key.def doKeyRight(board: Board) - tuple[bool, Board]:return False, board# Returns a list of tuples (row, col)# indicating where the empty spots aredef emptyPos(board: Board) - list[tuple[int, int]]:return [] Board Representation: The board (aka. grid) in this game is represented as a list of lists (2d list).Each tile on the board is represented as string, whereit is a string that is the value of the tile (e.g., '128'). As an example, the figure below show a 2-d listencoding and its corresponding board:(a single space) is an empty tile; otherwise,2 88boardA%3D' 8', '8'],' 4', '8'],'4', '4'],'2', '8'],'16']]4 | 84 4 44 42816What're You Implementing? There are a number of functions you are going to implement (see alsothe stubs in t2048.py). The first family of functions is concerned with movements:dokeyUp (board: list[list[str]])doKeyDown (board: list[list[str]]) - tuple[bool, list[list[str]]]doKeyLeft (board: list[list[str]]) - tuple[bool, list[1ist[str]]]doKeyRight (board: list[list[str]]) - tuple[bool, list[list[str]]]- tuple[bool, list[list[str]]]These correspond to the directions of movement up, down, left, and right, respectively. For each ofthese functions:Input: a board/grid whose dimension is as specified by the input.Output: returns a tuple (changed, new_board), where changed is a Boolean that indicateswhether or not the board has changed; and new_board is the board that results after that partic-ular movement is made.You are also to implement a few functions that help operate the game:emptyPos (board: list[list[str]]) - list[tuple[int, int]] takes as input a board(represented as described above) and returns a list of (row, col) tuples of empty spots onthis board. For example, for the board [['', '2'],['4',[(0,0), (1,1)].']], the function will return• isGameOver(board: list[list[str]]) - bool takes as input a board (represented likebefore) and returns the game on that given board is over (see the definition above). That is, itchecks whether the given board has any possible move remaining.Grading: We allocate 50 points for this problem. For each function we ask you to implement, we'lltest it thoroughly using a script and grade it manually for style and clarity. To explain what happens when the player slides the grid, we describe the effects in three steps (forpedagogical reasons, your code must implement these steps):STEP 1: Slide in the Direction of Movement. Youpush the tiles as far as possible in the direction going right. STEP 1 transforms the grid on the leftof movement until they cannot be moved in that below to the one on the right.EXAMPLE. Suppose the direction of movement isfurther. Similarly, you can imaginegravity pulling in the direction of movement, soall the blocks follow the gravitational force beforestopping at the grid's edge. As an example, weshow on the right a grid and what happens afterSTEP 1 when the direction of movement is right.directionany24482 44 82282 |282 222 42 222| 44 | 22 284 222| 81616EXAMPLE. Below, the left grid was processed bySTEP 2: Compact Similar Blocks. For each row orcolumn in the direction of movement (DOM), you STEP 1; the right grid shows the effects of STEP 2.will start at one end of the grid and walk in the Notice how the tiles are combined using this pro-DOM through the grid to the other end. Along this cess, paying attention especially to the rows thatwalk, upon encountering two adjacent tiles of thesame value, the latter is merged into the former,their point values combined. This means therewill no longer be a tile at the latter location. Then,the walk continues. Keep in mind that more thanone merges can take place per walk.more than one merges take place.2|44 828822 848212 2+2| 44444|22 | 2 | 84 | 42|81616STEP 3: Slide Once More. You may have created EXAMPLE. Applying STEP 3 to the result of STEP 2gaps in STEP 2. Identical to STEP 1, Step 3 pushes yields the grid on the right below.the tiles as far as possible in the direction of move-ment until they cannot be moved in that direction2882|88484 |8any further.4|4 44444 |4284 |4|281616Special Circumstances: It is possible that a move will not cause any change to the grid. We call thistype of move a void move. Your program will handle this case specially.The game is considered over when the current grid is full and (ii) all directions of movement result invoid move.

Question

Python: 2048 games Board = list[list[str]]# Checks whether a given board has any# possible move left. If no more moves,# return True. Otherwise return False.def isGameOver(board: Board) -> bool:return False# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Up' key.def doKeyUp(board: Board) -> tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Down' key.def doKeyDown(board: Board) -> tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Left' key.def doKeyLeft(board: Board) -> tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Right' key.def doKeyRight(board: Board) -> tuple[bool, Board]:return False, board# Returns a list of tuples (row, col)# indicating where the empty spots aredef emptyPos(board: Board) -> list[tuple[int, int]]:return [] Board Representation: The board (aka. grid) in this game is represented as a list of lists (2d list).Each tile on the board is represented as string, whereit is a string that is the value of the tile (e.g., '128'). As an example, the figure below show a 2-d listencoding and its corresponding board:(a single space) is an empty tile; otherwise,2 88boardA%3D' 8', '8'],' 4', '8'],'4', '4'],'2', '8'],'16']]4 | 84 4 44 42816What're You Implementing? There are a number of functions you are going to implement (see alsothe stubs in t2048.py). The first family of functions is concerned with movements:dokeyUp (board: list[list[str]])doKeyDown (board: list[list[str]]) -> tuple[bool, list[list[str]]]doKeyLeft (board: list[list[str]]) -> tuple[bool, list[1ist[str]]]doKeyRight (board: list[list[str]]) -> tuple[bool, list[list[str]]]-> tuple[bool, list[list[str]]]These correspond to the directions of movement up, down, left, and right, respectively. For each ofthese functions:Input: a board/grid whose dimension is as specified by the input.Output: returns a tuple (changed, new_board), where changed is a Boolean that indicateswhether or not the board has changed; and new_board is the board that results after that partic-ular movement is made.You are also to implement a few functions that help operate the game:emptyPos (board: list[list[str]]) -> list[tuple[int, int]] takes as input a board(represented as described above) and returns a list of (row, col) tuples of empty spots onthis board. For example, for the board [['', '2'],['4',[(0,0), (1,1)].']], the function will return• isGameOver(board: list[list[str]]) -> bool takes as input a board (represented likebefore) and returns the game on that given board is over (see the definition above). That is, itchecks whether the given board has any possible move remaining.Grading: We allocate 50 points for this problem. For each function we ask you to implement, we'lltest it thoroughly using a script and grade it manually for style and clarity. To explain what happens when the player slides the grid, we describe the effects in three steps (forpedagogical reasons, your code must implement these steps):STEP 1: Slide in the Direction of Movement. Youpush the tiles as far as possible in the direction going right. STEP 1 transforms the grid on the leftof movement until they cannot be moved in that below to the one on the right.EXAMPLE. Suppose the direction of movement isfurther. Similarly, you can imaginegravity pulling in the direction of movement, soall the blocks follow the gravitational force beforestopping at the grid's edge. As an example, weshow on the right a grid and what happens afterSTEP 1 when the direction of movement is right.directionany24482 44 82282 |282 222 42 222| 44 | 22 284 222| 81616EXAMPLE. Below, the left grid was processed bySTEP 2: Compact Similar Blocks. For each row orcolumn in the direction of movement (DOM), you STEP 1; the right grid shows the effects of STEP 2.will start at one end of the grid and walk in the Notice how the tiles are combined using this pro-DOM through the grid to the other end. Along this cess, paying attention especially to the rows thatwalk, upon encountering two adjacent tiles of thesame value, the latter is merged into the former,their point values combined. This means therewill no longer be a tile at the latter location. Then,the walk continues. Keep in mind that more thanone merges can take place per walk.more than one merges take place.2|44 828822 848212 2+2| 44444|22 | 2 | 84 | 42|81616STEP 3: Slide Once More. You may have created EXAMPLE. Applying STEP 3 to the result of STEP 2gaps in STEP 2. Identical to STEP 1, Step 3 pushes yields the grid on the right below.the tiles as far as possible in the direction of move-ment until they cannot be moved in that direction2882|88484 |8any further.4|4 44444 |4284 |4|281616Special Circumstances: It is possible that a move will not cause any change to the grid. We call thistype of move a void move. Your program will handle this case specially.The game is considered over when the current grid is full and (ii) all directions of movement result invoid move.

Accepted Answer

Coded using Python 3.