def possiblemoves(grid):
        h = len(grid)
        w = len(grid[0])
        m = [] # moves

        for i, idata in enumerate(grid):
                for j, jdata in enumerate(idata):
                        # Northwest
                        if (i-2) > 0 and (j-2) > 0 and grid[i][j] == "P" and grid[i-1][j-1] == "P" and grid[i-2][j-2] == "H": m.append(((i,j), (i-1,j-1), (i-2, j-2)))
                        # Southwest
                        if (i+2) < h and (j-2) > 0 and grid[i][j] == "P" and grid[i+1][j-1] == "P" and grid[i+2][j-2] == "H": m.append(((i,j), (i+1,j-1), (i+2, j-2)))
                        # Northeast
                        if (i-2) > 0 and (j+2) < w and grid[i][j] == "P" and grid[i-1][j+1] == "P" and grid[i-2][j+2] == "H": m.append(((i,j), (i-1,j+1), (i-2, j+2)))
                        # Southeast
                        if (i+2) < h and (j+2) < w and grid[i][j] == "P" and grid[i+1][j+1] == "P" and grid[i+2][j+2] == "H": m.append(((i,j), (i+1,j+1), (i+2, j+2)))
                        # East
                        if (j+4) < h and grid[i][j] == "P" and grid[i][j+2] == "P" and grid[i][j+4] == "H": m.append(((i,j), (i,j+2), (i,j+4)))
                        # West
                        if (j-4) > 0 and grid[i][j] == "P" and grid[i][j-2] == "P" and grid[i][j-4] == "H": m.append(((i,j), (i,j-2), (i,j-4)))

        return m