Finding best possible values of grids
Source: IMOC 2021 C11
August 11, 2021
combinatoricsgridIMOC
Problem Statement
In an grid, each square is either filled or not filled. For each square, its value is defined as if it is filled and is defined as the number of neighbouring filled cells if it is not filled. Here, two squares are neighbouring if they share a common vertex or side. Let be the largest total value of squares in the grid. Determine the minimal real constant such that holds for any positive integers CSJL