Given an N×N chessboard, with two pieces, a black pawn and a white pawn randomly placed on the chessboard. What is the minimum number of steps required by the white pawn to reach the black pawn under the following assumptions?
- The pawns are always inside the board.
- The white pawn can move in either of the 8 directions.
- The black pawn is always stationary.
- The white pawn can move only 1 step at a time.