42. Bishop and Pawn

Task

Given the positions of a white bishop and a black pawn on the standard chess board, determine whether the bishop can capture the pawn in one move.

The bishop has no restrictions in distance for each move, but is limited to diagonal movement. Check out the example below to see how it can move:

Example

• For bishop = "a1" and pawn = "c3", the output should be
  bishopAndPawn(bishop, pawn) = true.

• For bishop = "h1" and pawn = "h3", the output should be
  bishopAndPawn(bishop, pawn) = false.

Input/Output

• [execution time limit]
  4 seconds (py3)

• [input] string bishop
  Coordinates of the white bishop in the chess notation.
  Guaranteed constraints: bishop.length = 2, 'a' ≤ bishop[0] ≤ 'h', 1 ≤ bishop[1] ≤ 8.

• [input] string pawn
  Coordinates of the black pawn in the same notation.
  Guaranteed constraints: pawn.length = 2, 'a' ≤ pawn[0] ≤ 'h', 1 ≤ pawn[1] ≤ 8.

• [output] boolean
  true if the bishop can capture the pawn, false otherwise.

My Solution

def bishopAndPawn(bishop, pawn):
    capturePosition = []
    for i in range(-7, 8):
        x = chr(ord(bishop[0]) + i)
        y1 = str(int(bishop[1]) + i)
        y2 = str(int(bishop[1]) - i)
        capturePosition.append(x + y1)
        capturePosition.append(x + y2)
    return pawn in capturePosition