Seated in a circle are $11$ wizards. A different positive integer not exceeding $1000$ is pasted onto the forehead of each. A wizard can see the numbers of the other $10$, but not his own. Simultaneously, each wizard puts up either his left hand or his right hand. Then each declares the number on his forehead at the same time. Is there a strategy on which the wizards can agree beforehand, which allows each of them to make the correct declaration?

Two players play a game on an infinite board that consists of unit squares. Player $I$ chooses a square and marks it with $O$. Then player $II$ chooses another square and marks it with $X$. They play until one of the players marks a whole row or a whole column of five consecutive squares, and this player wins the game. If no player can achieve this, the result of the game is a tie. Show that player $II$ can prevent player $I$ from winning.

Arne and Bertil play a game on an $11 \times 11$ grid. Arne starts. He has a game piece that is placed on the center od the grid at the beginning of the game. At each move he moves the piece one step horizontally or vertically. Bertil places a wall along each move any of an optional four squares. Arne is not allowed to move his piece through a wall. Arne wins if he manages to move the pice out of the board, while Bertil wins if he manages to prevent Arne from doing that. Who wins if from the beginning there are no walls on the game board and both players play optimally?

Bob and Cob are playing a game on an infinite grid of hexagons. On Bob's turn, he chooses one hexagon that has not yet been chosen, and draws a segment from the center of the hexagon to the midpoints of three of its sides. On Cob's turn, he erases one of Bob's edges made on the previous turn. Bob wins if his edges form a closed loop. Can Bob guarantee to win in a finite amount of time? (Note that Bob may win before Cob can play his next turn.) Proposed by [i]Jonathan He[/i]

Given $30$ equal cups with milk. An elf tries to make the amount of milk equal in all the cups. He takes a pair of cups and aligns the milk level in two cups. Can there be such an initial distribution of milk in the cups, that the elf will not be able to achieve his goal in a finite number of operations?

We are given a set $P$ of points and a set $L$ of straight lines. At the beginning there are 4 points, no three of which are collinear, and $L=\emptyset $. Two players are taking turns adding one or two lines to $L$, where each of these lines has to pass through at least two of the points in $P$. After that all intersection points of the lines in $L$ are added to $P$, if they are not already part of it. A player wins, if after his turn there are three collinear points from $P$, which lie on a line that isn’t from $L$. Find who of the two players has a winning strategy.

There are 2 pizzerias in a town, with 2010 pizzas each. Two scientists $A$ and $B$ are taking turns ($A$ is first), where on each turn one can eat as many pizzas as he likes from one of the pizzerias or exactly one pizza from each of the two. The one that has eaten the last pizza is the winner. Which one of them is the winner, provided that they both use the best possible strategy?

All the cells in a $8* 8$ board are colored white. Omar and Asaad play the following game: in the beginning Omar colors $n$ cells red, then Asaad chooses $4$ rows and $4$ columns and colors them black. Omar wins if there is at least one red cell. Find the least possible value for n such that Omar can always win regardless of Asaad's move.

Initially, the numbers $1, 2, \dots, 2024$ are written on a blackboard. Trixi and Nana play a game, taking alternate turns. Trixi plays first. The player whose turn it is chooses two numbers $a$ and $b$, erases both, and writes their (possibly negative) difference $a-b$ on the blackboard. This is repeated until only one number remains on the blackboard after $2023$ moves. Trixi wins if this number is divisible by $3$, otherwise Nana wins. Which of the two has a winning strategy? [i](Birgit Vera Schmidt)[/i]

(Game) At the beginning of the game the organisers place $4$ piles of paper disks onto the table. The player who is in turn takes away a pile, then divides one of the remaining piles into two nonempty piles. Whoever is unable to move, loses. [i]Defeat the organisers in this game twice in a row! A starting position will be given and then you can decide whether you want to go first or second.[/i]

Two players play the following game. The first player starts by writing either $0$ or $1$ and then, on his every move, chooses either $0$ or $1$ and writes it to the right of the existing digits until there are $1999$ digits. Each time the first player puts down a digit (except the first one) , the second player chooses two digits among those already written and swaps them. Can the second player guarantee that after his last move the line of digits will be symmetrical about the middle digit? (I Izmestiev)

There are two bowls on the table, in one there are $p$, in the other $q$ stones ($p, q \in N*$ ). Two players $A$ and $B$ take turns playing, starting with $A$. Who's turn: $\bullet$ takes a stone from one of the bowls $\bullet$or removes one stone from each bowl $\bullet$ or puts a stone from one of the bowls into the other. Whoever takes the last stone wins. Under what conditions can $A$ and under what conditions can $B$ force the win? The answer must be justified.

Chip and Dale play the following game. Chip starts by splitting $1001$ nuts between three piles, so Dale can see it. In response, Dale chooses some number $N$ from $1$ to $1001$. Then Chip moves nuts from the piles he prepared to a new (fourth) pile until there will be exactly $N$ nuts in any one or more piles. When Chip accomplishes his task, Dale gets an exact amount of nuts that Chip moved. What is the maximal number of nuts that Dale can get for sure, no matter how Chip acts? (Naturally, Dale wants to get as many nuts as possible, while Chip wants to lose as little as possible).

In the middle cell of the $1 \times 2005$ strip there is a chip. Two players each queues move it: first, the first player moves the piece one cell in any direction, then the second one moves it $2$ cells, the $1$st - by $4$ cells, the 2nd by $8$, etc. (the $k$-th shift occurs by $2^{k-1}$ cells). That, whoever cannot make another move loses. Who can win regardless of the opponent's play?

Let $n\ge 2$ be an integer. Ariane and Bérénice play a game on the number of the residue classes modulo $n$. At the beginning there is the residue class $1$ on each piece of paper. It is the turn of the player whose turn it is to replace the current residue class $x$ with either $x + 1$ or by $2x$. The two players take turns, with Ariane starting. Ariane wins if the residue class $0$ is reached during the game. Bérénice wins if she can prevent that permanently. Depending on $n$, determine which of the two has a winning strategy.

Among a group of programmers, every two either know each other or do not know each other. Eleven of them are geniuses. Two companies hire them one at a time, alternately, and may not hire someone already hired by the other company. There are no conditions on which programmer a company may hire in the first round. Thereafter, a company may only hire a programmer who knows another programmer already hired by that company. Is it possible for the company which hires second to hire ten of the geniuses, no matter what the hiring strategy of the other company may be?

$n$ people are in the plane, so that the closest person is unique and each one shoot this closest person with a squirt gun. If $n$ is odd, prove that there exists at least one person that nobody shot. If $n$ is even, will there always be a person who escape? Justify that.

Given a triangle $ABC$ with the unit area. The first player chooses a point $X$ on the side $[AB]$, than the second -- $Y$ on $[BC]$ side, and, finally, the first chooses a point $Z$ on $[AC]$ side. The first tries to obtain the greatest possible area of the $XYZ$ triangle, the second -- the smallest. What area can obtain the first for sure and how?

The King decided to reduce his Council consisting of thousand wizards. He placed them in a line and placed hats with numbers from $1$ to $1001$ on their heads not necessarily in this order (one hat was hidden). Each wizard can see the numbers on the hats of all those before him but not on himself or on anyone who stayed behind him. By King's command, starting from the end of the line each wizard calls one integer from $1$ to $1001$ so that every wizard in the line can hear it. No number can be repeated twice. In the end each wizard who fails to call the number on his hat is removed from the Council. The wizards knew the conditions of testing and could work out their strategy prior to it. (a) Can the wizards work out a strategy which guarantees that more than $500$ of them remain in the Council? (b) Can the wizards work out a strategy which guarantees that at least $999$ of them remain in the Council?

Let $n$ be a positive integer. Aslı and Zehra are playing a game on an $n\times n$ grid. Initially, $10n^2$ stones are placed on some of the unit squares of this grid. On each move (starting with Aslı), Aslı chooses a row or a column that contains at least two squares with different numbers of stones, and Zehra redistributes the stones in that row or column so that after redistribution, the difference in the number of stones between any two squares in that row or column is at most one. Furthermore, this move must change the number of stones in at least one square. For which values of $n$, regardless of the initial placement of the stones, can Aslı guarantee that every square ends up with the same number of stones?

Stekel and Prick play a game on an $ m \times n$ board, where $m$ and $n$ are positive are integers. They alternate turns, with Stekel starting. Spine bets on his turn, he always takes a pawn on a square where there is no pawn yet. Prick does his turn the same, but his pawn must always come into a square adjacent to the square that Spike just placed a pawn in on his previous turn. Prick wins like the whole board is full of pawns. Spike wins if Prik can no longer move a pawn on his turn, while there is still at least one empty square on the board. Determine for all pairs $(m, n)$ who has a winning strategy.

Define $f : \mathbb{Z}_+ \to \mathbb{Z}_+$ such that $f(1) = 1$ and $f(n) $ is the greatest prime divisor of $n$ for $n > 1$. Aino and Väinö play a game, where each player has a pile of stones. On each turn the player to turn with $m$ stones in his pile may remove at most $f(m)$ stones from the opponent's pile, but must remove at least one stone. (The own pile stays unchanged.) The first player to clear the opponent's pile wins the game. Prove that there exists a positive integer $n$ such that Aino loses, when both players play optimally, Aino starts, and initially both players have $n$ stones.

Two pupils $A$ and $B$ play the following game. They begin with a pile of $1998$ matches and $A$ plays first. A player who is on turn must take a nonzero square number of matches from the pile. The winner is the one who makes the last move. Decide who has the winning strategy and give one such strategy.

On a table, there are $11$ piles of ten stones each. Pete and Basil play the following game. In turns they take $1, 2$ or $3$ stones at a time: Pete takes stones from any single pile while Basil takes stones from different piles but no more than one from each. Pete moves first. The player who cannot move, loses. Which of the players, Pete or Basil, has a winning strategy?

Let $n> 1$ be an odd integer. On a square surface have been placed $n^2 - 1$ white slabs and a black slab on the center. Two workers $A$ and $B$ take turns removing them, betting that whoever removes black will lose. First $A$ picks a slab; if it has row number $i \ge (n + 1) / 2$, then it will remove all tiles from rows with number greater than or equal to$ i$, while if $i <(n + 1) / 2$, then it will remove all tiles from the rows with lesser number or equal to $i$. Proceed in a similar way with columns. Then $B$ chooses one of the remaining tiles and repeats the process. Determine who has a winning strategy and describe it. Note: Row and column numbering is ascending from top to bottom and from left to right.