Problem

Source: XVIII Tuymaada Mathematical Olympiad (2011), Senior Level

Tags: combinatorics unsolved, combinatorics



Written in each square of an infinite chessboard is the minimum number of moves needed for a knight to reach that square from a given square $O$. A square is called singular if $100$ is written in it and $101$ is written in all four squares sharing a side with it. How many singular squares are there?