Valid bishop chess moves
A bishop is placed in a square \(x\) on a \(8 \times 8\) chessboard and then moves once, ending in the square \(y\). How many possible ordered pairs \((x,y)\) 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.