# Chess Puzzle to calculate the minimum number of movements of pawn [closed]

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?

1. The pawns are always inside the board.
2. The white pawn can move in either of the 8 directions.
3. The black pawn is always stationary.
4. The white pawn can move only 1 step at a time.
• Shouldn't the minimum always be 1, assuming the RNG cooperates? – Excited Raichu Jul 3 '19 at 12:49
• I am not sure...is this question related to probability? – susane Jul 3 '19 at 12:52
• Well, asking for the minimum in the context of this question doesnt make all that sense. If you mean the minimum across all of the possibilities, it's definitely 1. If you mean something else, I'm not sure if we have enough information. – Excited Raichu Jul 3 '19 at 12:55
• Hi @susane and welcome to Puzzling. Unfortrunately, we're a bit strict around here about what actually counts as a puzzle and this question doesn't really fit. Also, it sounds as if this is a question you got from somewhere else, and for those we require proper attribution -- we need to know where it's from, so that the source gets appropriate credit. So I've closed this as off-topic. I'm sorry if this is a discouraging introduction to Puzzling; if you're interested in puzzles, I hope you'll stay around anyway! – Gareth McCaughan Jul 3 '19 at 14:50