From the 2001 Moscow Mathematical Olympiad:
Two stones, one black and one white, are placed on a chessboard. A move consists of moving one stone up, down, left, or right. The two stones may not occupy the same square. Does a sequence of moves exist that will produce every possible arrangement of the stones, each occurring exactly once?