MathDB

Consider an

n \times n

grid consisting of

n^2

until cells, where

n \geq 3

is a given odd positive integer. First, Dionysus colours each cell either red or blue. It is known that a frog can hop from one cell to another if and only if these cells have the same colour and share at least one vertex. Then, Xanthias views the colouring and next places

k

frogs on the cells so that each of the

n^2

cells can be reached by a frog in a finite number (possible zero) of hops. Find the least value of

k

for which this is always possible regardless of the colouring chosen by Dionysus.
Proposed by Tommy Walker Mackay, United Kingdom

Problem Statement