A bishop is placed in a square on a chessboard and then moves once, ending in the square . How many possible ordered pairs are there?
Details and assumptions
A bishop moves diagonally on a chessboard. The bishop cannot end on the same square it started, it must move to a different square.