The Bishop's Colors — Solution & Editorial

Back to the Problem

Bishops never leave their square color ((r+c) mod 2). Same cell: 0; same diagonal: 1; same color otherwise: 2 (via one intermediate); different color: impossible.

Complexity: O(1)

Watch out: The color argument (parity of r+c) decides reachability before any distance logic.