[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1], [1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1], [1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1], [1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1], [1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
[1,1]
[10,10]
Вот я тут что-то понаписывал.
def searchway(lab): x = 1 y = 1 res = '' while x != 10 and y != 10: for i in range(1, 11): for j in range(1,11): if lab[i - x][j] == 1 and lab[i][j - y] == 1: y += 1 res += 'E' if lab[i - x][j] == 1 and lab[i][j - y] == 1 and lab[i][j + y] == 1: x += 1 res += 'S' if lab[i - x][j] == 1 and lab[i][j + y] == 1: y -= 1 res += 'W' if lab[i + x][j] == 1 and lab[i][j - y] == 1 and lab[i][j + y] == 1: x -= 1 res += 'N' return(res)
if lab[i - x][j] == 1 and lab[i][j + y] == 1:
list index out of range