Number of moves required to move a bishop from starting position to ending position

  • 0

    On a 8 X 8 chessboard, if you are given a starting position. Find out the number of moves required for the bishop to move to a ending position. Return -1 if that position can't be reached.

    • Input: Bishop's starting position
    • Output: Return Number of moves. return -1 if the move is not possible.

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.