February 2–February 8, 2010
A "myopic rook" can move only from a square to a vertical or horizontal neighbor. It follows a path which visits each square of an 8x8 chessboard exactly once.
Show that there are more such paths starting at a corner square than paths starting at a diagonal neighbor of a corner square.
List of solvers
Apparently this was a tougher problem than expected; only one person solved it:
Lloyd Sakazaki (outside).
Lloyd Sakazaki wins the prize!