Hunting an invisible tank in a 100x100 table
Source: 239 2017 S7
May 22, 2020
combinatorics
Problem Statement
An invisible tank is on a table. A cannon can fire at any cells of the board after that the tank will move to one of the adjacent cells (by side). Then the progress is repeated. Find the smallest value of such that the cannon can definitely shoot the tank after some time.