Поворот двумерного массива

import random as rnd
import numpy as np
 
def reverse():
    for i in range(N):
        arr[i] = arr[i][::1]
 
def transpon():
    for i in range(N):
        for j in range(N):
            arr[i][j], arr[j][i] = arr[j][i], arr[i][j]
 
def rotate():
    reverse()
    transpon()
 
def gen():
    p = []
    for i in range(N):
        for j in range(N):
            if arr[i][j] == 0:
                p.append([i, j])
    x, y = rnd.choice(p)
    arr[x][y] = rnd.choice([2, 2, 2, 2, 4])
 
def arr_out():
    for e in arr:
        print(*e)
 
def move_left():
    for i in range(N):
        h = 0
        for j in range(1, N):
            if arr[i][j] == 0: continue
            if arr[i][h] == 0:
                arr[i][h] = arr[i][j]
                arr[i][j] = 0
            elif arr[i][h] == arr[i][j]:
                arr[i][h] *= 2
                arr[i][j] = 0
                h += 1
            else:
                arr[i][h + 1], arr[i][j] = arr[i][j], arr[i][h + 1]
                h += 1
 
def mv_left():
    move_left()
 
def mv_right():
    for i in range(1):
        rotate()
    move_left()
    for i in range(1):
        rotate()
 
def mv_down():
    rotate()
    move_left()
    for i in range(3):
        rotate()
 
def mv_up():
    for i in range(3):
        rotate()
    move_left()
    rotate()
                
def probe():
    count = 0
    for i in range(N):
        for j in range(N):
            if arr[i][j] == 0:
                count += 1
    if count > 0:
        return 0
    else:
        return 1
    
def debug():
    end_game = 0
    while end_game == 0:
        gen()
        arr_out()
        c = input()
        if c == 'A' or c == 'a':
            for g in range(N):
                mv_left()
        if c == 'S' or c == 's':
            for g in range(N):
                mv_down()
        end_game = probe()
 
N = 4
arr = [[0,0,0,0], [0,0,0,0], [0,0,0,0], [0,0,0,0]]
debug()