Found problems: 189
Let $ n$ and $ k$ be positive integers such that $ \frac{1}{2} n < k \leq \frac{2}{3} n.$ Find the least number $ m$ for which it is possible to place $ m$ pawns on $ m$ squares of an $ n \times n$ chessboard so that no column or row contains a block of $ k$ adjacent unoccupied squares.
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.
Given a chessboard $n \times n$, where $n\geq 4$ and $p=n+1$ is a prime number. A set of $n$ unit squares is called [i]tactical[/i] if after putting down queens on these squares, no two queens are attacking each other. Prove that there exists a partition of the chessboard into $n-2$ tactical sets, not containing squares on the main diagonals.
Queens are allowed to move horizontally, vertically and diagonally.
A marble is placed on each $33$ unit square of a $10*10$ chessboard. After that, the number of marbles in the same row or column with that square is written on each of the remaining empty unit squares. What is the maximum sum of the numbers written on the board?
Consider decompositions of an $8\times 8$ chessboard into $p$ non-overlapping rectangles subject to the following conditions:
(i) Each rectangle has as many white squares as black squares.
(ii) If $a_i$ is the number of white squares in the $i$-th rectangle, then $a_1<a_2<\ldots <a_p$.
Find the maximum value of $p$ for which such a decomposition is possible. For this value of $p$, determine all possible sequences $a_1,a_2,\ldots ,a_p$.
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?
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]
Let $n$ be a positive integer. In how many ways can we mark cells on an $n\times n$ board such that no two rows and no two columns have the same number of marked cells?
[i]Selim Bahadir, Turkey[/i]
On a chessboard a square is chosen . The sum of the squares of distances from its centre to the centre of all black squares is designated by $a$ and to the centre of all white squares by $b$. Prove that $a = b$.
(A. Andj ans, Riga)
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)
Investigate whether a chess knight can traverse a $4 \times 4$ mini-chessboard so that it reaches each of the $16$ squares only once.
Note: the drawing below shows the endpoints of the eight possible moves of the knight $(C)$ on a chessboard of size $8 \times 8$.
[asy]
unitsize(0.4 cm);
int i;
fill(shift((2,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7));
fill(shift((4,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7));
fill(shift((1,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7));
fill(shift((5,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7));
fill(shift((1,5))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7));
fill(shift((5,5))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7));
fill(shift((2,6))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7));
fill(shift((4,6))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7));
for (i = 0; i <= 8; ++i) {
draw((i,0)--(i,8));
draw((0,i)--(8,i));
}
label("C", (3.5,4.5), fontsize(8));
[/asy]
The fields of an $n\times n$ chess board are colored black and white, such that in every small $2\times 2$-square both colors should be the same number. How many there possibilities are for this?
A set $A$ of squares is given on a chessboard which is infinite in all directions. On each square of this chessboard which does not belong to $A$ there is a king. On a command all kings may be moved in such a way that each king either remains on its square or is moved to an adjacent square, which may have been occupied by another king before the command. Each square may be occupied by at most one king. Does there exist such a number $k$ and such a way of moving the kings that after $k$ moves the kings will occupy all squares of the chessboard? Consider the following cases:
(a) $A$ is the set of all squares, both of whose coordinates are multiples of $100$. (There is a horizontal line numbered by the integers from $-\infty$ to $+\infty$, and a similar vertical line. Each square of the chessboard may be denoted by two numbers, its coordinates with respect to these axes.)
(b) $A$ is the set of all squares which are covered by $100$ fixed arbitrary queens (i.e. each square covered by at least one queen).
Remark:
If $A$ consists of just one square, then $k = 1$ and the required way is the following:
all kings to the left of the square of $A$ make one move to the right.
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$?
A $T$-tetromino is a non-convex as well as non-rotationally symmetrical tetromino, which has a maximum number of outside corners (popularly also "Tetris Stone "called). Find all natural numbers $n$ for which, a $n \times n$ chessboard is found that can be covered only with such $T$-tetrominos.
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.
A chessboard $1000 \times 1000$ is covered by dominoes $1 \times 10$ that can be rotated. We don't know which is the cover, but we are looking for it. For this reason, we choose a few $N$ cells of the chessboard, for which we know the position of the dominoes that cover them.
Which is the minimum $N$ such that after the choice of $N$ and knowing the dominoed that cover them, we can be sure and for the rest of the cover?
(Bulgaria)
The numbers from $1$ to $64$ must be written on the small squares of a chessboard, with a different number in each small square. Consider the $112$ numbers you can make by adding the numbers in two small squares which have a common edge. Is it possible to write the numbers in the squares so that these $112$ sums are all different?
A chess piece moves as follows: it can jump 8 or 9 squares either vertically or horizontally. It is not allowed to visit the same square twice. At most, how many squares can this piece visit on a $15 \times 15$ board (it can start from any square)?
[i](4 points)[/i]
Given a positive integer $n (n>2004)$, we put 1, 2, 3, …,$n^2$ into squares of an $n\times n$ chessboard with one number in a square. A square is called a “good square” if the square satisfies following conditions:
1) There are at least 2004 squares that are in the same row with the square such that any number within these 2004 squares is less than the number within the square.
2) There are at least 2004 squares that are in the same column with the square such that any number within these 2004 squares is less than the number within the square.
Find the maximum value of the number of the “good square”.
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)
Consider the following one-player game on an infinite chessboard. If two horizontally or vertically adjacent squares are occupied by a pawn each, and a square on the same line that is adjacent to one of them is empty, then it is allowed to remove the two pawns and place a pawn on the third (empty) square. Prove that if in the initial position all the pawns were forming a rectangle with the number of squares divisible by $3$, then it is not possible to end the game with only one pawn left on the board.
We put a figure of a king on some $6 \times 6$ chessboard. It can in one thrust jump either vertically or horizontally. The length of this jump is alternately one and two squares, whereby a jump of one (i.e. to the adjacent square) of the piece begins. Decide whether you can choose the starting position of the pieces so that after a suitable sequence $35$ jumps visited each box of the chessboard just once.
A closed, non-self-intersecting broken line $L$ is drawn over a $(2n+1) \times (2n+1)$ chessboard in such a way that the set of L's vertices coincides with the set of the vertices of the board’s squares and every edge in $L$ is a side of some board square. All board squares lying in the interior of $L$ are coloured in red. Prove that the number of neighbouring pairs of red squares in every row of the board is even.
The white fields of $1983\times 1984 $1983x1984 are filled with either $+1$ or $-1$. For every black field, the product of neighbouring numbers is $+1$. Prove that all the numbers are $+1$.