Browse · MathNet
Print41st Balkan Mathematical Olympiad
counting and probability
Problem
Let , be positive integers. Julia and Florian play a game on a board. Julia has secretly tiled the entire board with invisible dominos. Florian now chooses cells. All dominos covering at least one of these cells then turn visible. Determine the minimal value of such that Florian has a strategy to always deduce the entire tiling.
Solution
The minimal value of with this property is . We first show that in order for Florian to be able to deduce the entire tiling, we must have . If Julia picks an independent tiling on each of disjoint regions, then Florian needs to reveal at least one domino from each region to deduce the entire tiling. Hence .
Now colour the squares of the board with 4 different colours, such that the colouring is periodic with period 2 squares in both horizontal and vertical direction. We show that if Florian reveals the dominos covering the squares of one colour class, then there is at most one tiling of the board that contains this arrangement of revealed dominos.
Let red be one of the 4 colours and assume that we have two distinct tilings and of the board that agree on all the dominos covering a red square. We call a square of the board augmented if it is covered in a different way by and . Given an augmented square , let and be the two squares covered by the same domino in the tiling and , respectively. By definition, we have and and must both be augmented as well. Repeating this argument, we find distinct augmented squares with where indices are taken modulo . Hence, there is a closed path of orthogonally neighbouring squares that does not contain a red square and that is tiled by the restriction of both tilings and .
Now, since the tilings and tile the path , they must also tile the odd sized region enclosed by . This is impossible since every domino covers exactly 2 squares, contradicting our initial assumption. We conclude that if two tilings agree on the red squares, they must in fact be the same tiling. Hence, if Florian knows how the red squares are tiled, there is a unique way to complete this tiling to the entire board, which he can deduce by searching though all the finitely many tilings of the board.
Now colour the squares of the board with 4 different colours, such that the colouring is periodic with period 2 squares in both horizontal and vertical direction. We show that if Florian reveals the dominos covering the squares of one colour class, then there is at most one tiling of the board that contains this arrangement of revealed dominos.
Let red be one of the 4 colours and assume that we have two distinct tilings and of the board that agree on all the dominos covering a red square. We call a square of the board augmented if it is covered in a different way by and . Given an augmented square , let and be the two squares covered by the same domino in the tiling and , respectively. By definition, we have and and must both be augmented as well. Repeating this argument, we find distinct augmented squares with where indices are taken modulo . Hence, there is a closed path of orthogonally neighbouring squares that does not contain a red square and that is tiled by the restriction of both tilings and .
Now, since the tilings and tile the path , they must also tile the odd sized region enclosed by . This is impossible since every domino covers exactly 2 squares, contradicting our initial assumption. We conclude that if two tilings agree on the red squares, they must in fact be the same tiling. Hence, if Florian knows how the red squares are tiled, there is a unique way to complete this tiling to the entire board, which he can deduce by searching though all the finitely many tilings of the board.
Final answer
n^2
Techniques
Coloring schemes, extremal argumentsInvariants / monovariantsGames / greedy algorithms