Bot Saves Princess Hackerrank AI problem: https://www.hackerrank.com/challenges/saveprincess

bot_saves_princess.py

#!/usr/bin/python
import math
def displayPathtoPrincess(n,grid):
#print all the moves here
    princess = ()
    for row in range(n):
        for col in range(len(grid[row])):
            if grid[row][col] == 'p':
                princess = (row, col)
                break
    m = (n//2, n//2)
    x = m[0] - princess[0]
    y = m[1] - princess[1]
    dir = 'UP\n' if x > 0 else 'DOWN\n'
    print(dir * int(math.fabs(x)), end='')
    dir = 'LEFT\n' if y > 0 else 'RIGHT\n'
    print(dir * int(math.fabs(y)), end='')

m = int(input())
grid = [] 
for i in range(0, m): 
    grid.append(input().strip())

displayPathtoPrincess(m,grid)