Found problems: 187
2019 Greece JBMO TST, 4
Consider a $8\times 8$ chessboard where all $64$ unit squares are at the start white. Prove that, if any $12$ of the $64$ unit square get painted black, then we can find $4$ lines and $4$ rows that have all these $12$ unit squares.
1998 Abels Math Contest (Norwegian MO), 2
Let be given an $n \times n$ chessboard, $n \in N$. We wish to tile it using particular tetraminos which can be rotated. For which $n$ is this possible if we use
(a) $T$-tetraminos
(b) both kinds of $L$-tetraminos?
2003 Estonia National Olympiad, 1
Jiiri and Mari both wish to tile an $n \times n$ chessboard with cards shown in the picture (each card covers exactly one square). Jiiri wants that for each two cards that have a common edge, the neighbouring parts are of different color, and Mari wants that the neighbouring parts are always of the same color. How many possibilities does Jiiri have to tile the chessboard and how many possibilities does Mari have?
[img]https://cdn.artofproblemsolving.com/attachments/7/3/9c076eb17ba7ae7c000a2893c83288a94df384.png[/img]
1933 Eotvos Mathematical Competition, 2
Sixteen squares of an $8\times 8$ chessboard are chosen so that there are exactly lwo in each row and two in each column. Prove that eight white pawns and eight black pawns can be placed on these sixteen squares so that there is one white pawn and one black pawn in each row and in cach colunm.
2019 Saint Petersburg Mathematical Olympiad, 6
Is it possible to arrange everything in all cells of an infinite checkered plane all natural numbers (once) so that for each $n$ in each square $n \times n$ the sum of the numbers is a multiple of $n$?
1999 Estonia National Olympiad, 5
On the squares $a1, a2,... , a8$ of a chessboard there are respectively $2^0, 2^1, ..., 2^7$ grains of oat, on the squares $b8, b7,..., b1$ respectively $2^8, 2^9, ..., 2^{15}$ grains of oat, on the squares $c1, c2,..., c8$ respectively $2^{16}, 2^{17}, ..., 2^{23}$ grains of oat etc. (so there are $2^{63}$ grains of oat on the square $h1$). A knight starts moving from some square and eats after each move all the grains of oat on the square to which it had jumped, but immediately after the knight leaves the square the same number of grains of oat reappear. With the last move the knight arrives to the same square from which it started moving. Prove that the number of grains of oat eaten by the knight is divisible by $3$.
2012 Brazil Team Selection Test, 3
In chess, a king threatens another king if, and only if, they are on neighboring squares, whether horizontally, vertically, or diagonally . Find the greatest amount of kings that can be placed on a $12 \times 12$ board such that each king threatens just another king. Here, we are not considering part colors, that is, consider that the king are all, say, white, and that kings of the same color can threaten each other.
1997 Tournament Of Towns, (559) 4
The maximum possible number of knights are placed on a $5 \times 5$ chessboard so that no two attack each other. Prove that there is only one possible placement.
(A Kanel)
I Soros Olympiad 1994-95 (Rus + Ukr), 11.4
Given a chessboard that is infinite in all directions. Is it possible to place an infinite number of queens on it so that on each horizontally, on each vertical and on each diagonal of both directions (i.e. on a set of cells located at an angle of $45^o$ or $135^o$ to the horizontal) was exactly one queen?
2010 Junior Balkan Team Selection Tests - Romania, 4
An $8 \times 8$ chessboard consists of $64$ square units. In some of the unit squares of the board, diagonals are drawn so that any two diagonals have no common points. What is the maximum number of diagonals that can be drawn?
1986 All Soviet Union Mathematical Olympiad, 433
Find the relation of the black part length and the white part length for the main diagonal of the
a) $100\times 99$ chess-board;
b) $101\times 99$ chess-board.
2013 QEDMO 13th or 12th, 5
$16$ pieces of the shape $1\times 3$ are placed on a $7\times 7$ chessboard, each of which is exactly three fields. One field remains free. Find all possible positions of this field.
2000 Tournament Of Towns, 4
In how many ways can $31$ squares be marked on an $8 \times 8$ chessboard so that no two of the marked squares have a common side?
(R Zhenodarov)
2008 Bulgaria Team Selection Test, 1
Let $n$ be a positive integer. There is a pawn in one of the cells of an $n\times n$ table. The pawn moves from an arbitrary cell of the $k$th column, $k \in \{1,2, \cdots, n \}$, to an arbitrary cell in the $k$th row. Prove that there exists a sequence of $n^{2}$ moves such that the pawn goes through every cell of the table and finishes in the starting cell.
2001 Portugal MO, 4
During a game of chess, at a certain point, in each row and column of the board there is an odd number of pieces. Prove that the number of pieces that are on black squares is even. (Note: a chessboard has $8$ rows and $8$ columns)
2021 Science ON Juniors, 4
An $n\times n$ chessboard is given, where $n$ is an even positive integer. On every line, the unit squares are to be permuted, subject to the condition that the resulting table has to be symmetric with respect to its main diagonal (the diagonal from the top-left corner to the bottom-right corner). We say that a board is [i]alternative[/i] if it has at least one pair of complementary lines (two lines are complementary if the unit squares on them which lie on the same column have distinct colours). Otherwise, we call the board [i]nonalternative[/i]. For what values of $n$ do we always get from the $n\times n$ chessboard an alternative board?\\ \\
[i](Alexandru Petrescu and Andra Elena Mircea)[/i]
2016 Saudi Arabia BMO TST, 4
On a chessboard $5 \times 9$ squares, the following game is played.
Initially, a number of frogs are randomly placed on some of the squares, no square containing more than one frog. A turn consists of moving all of the frogs subject to the following rules:
$\bullet$ Each frog may be moved one square up, down, left, or right;
$\bullet$ If a frog moves up or down on one turn, it must move left or right on the next turn, and vice versa;
$\bullet$ At the end of each turn, no square can contain two or more frogs.
The game stops if it becomes impossible to complete another turn. Prove that if initially $33$ frogs are placed on the board, the game must eventually stop. Prove also that it is possible to place $32$ frogs on the board so that the game can continue forever.
2008 Argentina National Olympiad, 6
Consider a board of $a \times b$, with $a$ and $b$ integers greater than or equal to $2$. Initially their squares are colored black and white like a chess board. The permitted operation consists of choosing two squares with a common side and recoloring them as follows: a white square becomes black; a black box turns green; a green box turns white. Determine for which values of $a$ and $b$ it is possible, by a succession of allowed operations, to make all the squares that were initially white end black and all the squares that were initially black end white.
Clarification: Initially there are no green squares, but they appear after the first operation.
1984 All Soviet Union Mathematical Olympiad, 391
The white fields of $3x3$ chess-board are filled with either $+1$ or $-1$. For every field, let us calculate the product of neighbouring numbers. Then let us change all the numbers by the respective products. Prove that we shall obtain only $+1$'s, having repeated this operation finite number of times.
2011 Brazil Team Selection Test, 3
2500 chess kings have to be placed on a $100 \times 100$ chessboard so that
[b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex);
[b](ii)[/b] each row and each column contains exactly 25 kings.
Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.)
[i]Proposed by Sergei Berlov, Russia[/i]
2004 Canada National Olympiad, 2
How many ways can $ 8$ mutually non-attacking rooks be placed on the $ 9\times9$ chessboard (shown here) so that all $ 8$ rooks are on squares of the same color?
(Two rooks are said to be attacking each other if they are placed in the same row or column of the board.)
[asy]unitsize(3mm);
defaultpen(white);
fill(scale(9)*unitsquare,black);
fill(shift(1,0)*unitsquare);
fill(shift(3,0)*unitsquare);
fill(shift(5,0)*unitsquare);
fill(shift(7,0)*unitsquare);
fill(shift(0,1)*unitsquare);
fill(shift(2,1)*unitsquare);
fill(shift(4,1)*unitsquare);
fill(shift(6,1)*unitsquare);
fill(shift(8,1)*unitsquare);
fill(shift(1,2)*unitsquare);
fill(shift(3,2)*unitsquare);
fill(shift(5,2)*unitsquare);
fill(shift(7,2)*unitsquare);
fill(shift(0,3)*unitsquare);
fill(shift(2,3)*unitsquare);
fill(shift(4,3)*unitsquare);
fill(shift(6,3)*unitsquare);
fill(shift(8,3)*unitsquare);
fill(shift(1,4)*unitsquare);
fill(shift(3,4)*unitsquare);
fill(shift(5,4)*unitsquare);
fill(shift(7,4)*unitsquare);
fill(shift(0,5)*unitsquare);
fill(shift(2,5)*unitsquare);
fill(shift(4,5)*unitsquare);
fill(shift(6,5)*unitsquare);
fill(shift(8,5)*unitsquare);
fill(shift(1,6)*unitsquare);
fill(shift(3,6)*unitsquare);
fill(shift(5,6)*unitsquare);
fill(shift(7,6)*unitsquare);
fill(shift(0,7)*unitsquare);
fill(shift(2,7)*unitsquare);
fill(shift(4,7)*unitsquare);
fill(shift(6,7)*unitsquare);
fill(shift(8,7)*unitsquare);
fill(shift(1,8)*unitsquare);
fill(shift(3,8)*unitsquare);
fill(shift(5,8)*unitsquare);
fill(shift(7,8)*unitsquare);
draw(scale(9)*unitsquare,black);[/asy]
1994 ITAMO, 6
The squares of a $10 \times 10$ chessboard are labelled with $1,2,...,100 $ in the usual way: the $i$-th row contains the numbers $10i -9,10i - 8,...,10i$ in increasing order. The signs of fifty numbers are changed so that each row and each column contains exactly five negative numbers. Show that after this change the sum of all numbers on the chessboard is zero.
2016 IFYM, Sozopol, 6
We are given a chessboard 100 x 100, $k$ barriers (each with length 1), and one ball. We want to put the barriers between the cells of the board and put the ball in some cell, in such way that the ball can get to each possible cell on the board. The only way that the ball can move is by lifting the board so it can go only forward, backward, to the left or to the right. The ball passes all cells on its way until it reaches a barrier or the edge of the board where it stops. What’s the least number of barriers we need so we can achieve that?
2001 Swedish Mathematical Competition, 6
A chessboard is covered with $32$ dominos. Each domino covers two adjacent squares. Show that the number of horizontal dominos with a white square on the left equals the number with a white square on the right.
1967 All Soviet Union Mathematical Olympiad, 091
"KING-THE SUICIDER"
Given a chess-board $1000\times 1000$, $499$ white castles and a black king. Prove that it does not matter neither the initial situation nor the way white plays, but the king can always enter under the check in a finite number of moves.