Consider a \(8 \times 8 \) grid. Several of the tiles have tokens on them and there can only be one token on any tile. Call any tile "brilliant" if there exists an adjacent tile with a token on it.

What is the minimum number of tokens needed so that all tiles of the chessboard are brilliant?

Note: 2 tiles are adjacent if they share a common side. Tiles that only share a common corner are not considered adjacent.

×

Problem Loading...

Note Loading...

Set Loading...