Chess: bishop and knight

[BMAD]

Say we have two white pieces, bishop and knight.  The bishop and knight are in their starting position, adjacent to each other.  For the sake of argument, say the white bishop is on white.  What square(s) on the board requires the most moves for either piece to reach?

[Rob_G]

Let's hope I do this right. I'm posting from my phone. 

So assuming the same as above bishop on f1 and knight on g1 I would say:

The bishop can reach any square in 1 or 2 moves.

The knight takes at most 5 moves to reach a square as stated above.

[bonanova]

On further review, Rob and I are both right.

But Rob is "righter:

My statement about the bishop is true:

and all the other squares can be reached in three moves, as just explained.

It's just that that class of squares is empty!

And what happened to the emoticon where the guy slaps his forehead...?

[bonanova]

White KB begins on KB1, or in standard chess notation on f1, a white square. The white KN is at its side on square g1.

The bishop moves to g2 which lies on a major diagonal, from which it can reach any point not on the diagonal in 2 additional moves. Beginning at f1, therefore, the squares that can be reached in 1 move lie on its original diagonals, those that require 2 moves lie on a diagonal that cuts any of the 1-move squares, and all the other squares can be reached in three moves, as just explained.

Beginning at f1, the following squares can be reached in, and require 1, 2 and 3 moves respectively: g2, h1 and h5.

The Knight can reach any point on the board in 5 moves.

Beginning at g1 the following squares can be reached in, and in fact require, 1, 2, 3, 4 and 5 moves respectively: e2, d4, e6, c7, a8. The squares that require 5 moves are a6, b7, a8, c8, e8 and g8

[BMAD]

White KB begins on KB1, or in standard chess notation on f1, a white square. The white KN is at its side on square g1.

Hidden Content

White bishop should be able to reach all white squares in two moves.