Battleship revisited with 3 colors in n x 4 board
Source: V- Rioplatense 1996 L3 P5
September 19, 2022
geometrycombinatoricscombinatorial geometrygame strategygame
Problem Statement
There is a board with rows and columns, and white, yellow and light blue chips.
Player places four tokens on the first row of the board and covers them so Player doesn't know them.
How should player do to fill the minimum number of rows with chips that will ensure that in any of the rows he will have at least three hits?Clarification: A hit by player occurs when he places a token of the same color and in the same column as .