This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 2

What is the largest number of cells that can be marked on a $100 \times 100$ board in such a way that a chess king from any cell attacks no more than two marked ones? (The cell on which a king stands is also considered to be attacked by this king.)
We visit all squares exactly once on a $n\times n$ chessboard (colored in the usual way) with a king. Find the smallest number of times we had to switch colors during our walk. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]