孤独的骑士

解题思路:

注意事项:

参考代码:

n = int(input())

for i in range(n):

    s = 0

    m = input()

    d = [[-1,-2],[-1,2],[1,-2],[1,2],[-2,-1],[-2,1],[2,-1],[2,1]]

    a = ord(m[0])-ord('a')

    b = int(m[1])-1

    for i in range(len(d)):

        if 0<=a+d[i][0]<8 and 0<=b+d[i][1]<8:

            s+=1

    print(s)