Here is LightOJ Main Problem There is an Infinite chessboard. Two bishops are there. (Bishop means the chess piece that moves diagonally). Now you are given the position of the two bishops. You have to find the minimum chess moves to take one to another. With a chess move, a bishop can be moved to…