 |
1. |
pretorik |
- |
161 |
2. |
markr |
- |
116 |
3. |
Gordon Weir |
- |
104 |
4. |
mbloomfi |
- |
97 |
5. |
Dennis Nazarov |
- |
96 |
6. |
zzz123 |
- |
72 |
7. |
Srikanta |
- |
56 |
8. |
lidSpelunker |
- |
53 |
9. |
SAMIH FAHMY |
- |
48 |
10. |
jkr |
- |
44 |
|
 |
 |
 |
1. |
denisR, mishik |
- |
236 |
2. |
alan, De_Bill |
- |
231 |
3. |
dddfff |
- |
228 |
4. |
kavfy |
- |
221 |
5. |
idler_ |
- |
106 |
6. |
akajobe |
- |
94 |
7. |
tolstyi |
- |
56 |
8. |
STARuK |
- |
42 |
9. |
vale |
- |
31 |
10. |
xandr |
- |
11 |
|
 |
 |
|
The mouse hunt |
Games puzzles |
 |
Weight: 4 |
 |
Liked the puzzle: 100% |
 |
11.01.2010 |
|
A smart cat named Leopold is hunting a mouse. A mouse is hiding in one
of five holes arranged in a row. Leopold can reach into one of the
holes and try to catch the mouse. If he is not successful, the scared
mouse runs into a right/left neighboring hole. Is it guaranteed that
Leopold will catch the mouse? If so, what should he do? |
 |
|
Puzzle statistics "The mouse hunt".
Last updated 6579395.8 minutes ago.
|
Solved by: 11
Daily average: 0
Answers submitted: 18
Viewed by: 290
Fraction solved by: 3.7%
Solved at first attempt: 54.5%
Average discussion length: 2.2
Liked the puzzle: 5
Did not like the puzzle:
0
|
Tic-tac-toe, the Megamind style |
Games puzzles |
 |
Weight: 4 |
 |
Liked the puzzle: 100% |
 |
26.02.2011 |
|
Two Megaminds decided to play tic-tac-toe using new rules. They use a
regular 3x3 playing pad, but each player can choose to
place either an X or an O into one of the cells. The winner is still
the one who arranges three X's or three O's in a line. Is there a
winning strategy in this game? Which player has it? |
 |
|
Puzzle statistics "Tic-tac-toe, the Megamind style".
Last updated 6579395.8 minutes ago.
|
Solved by: 7
Daily average: 0
Answers submitted: 8
Viewed by: 56
Fraction solved by: 12.5%
Solved at first attempt: 71.4%
Average discussion length: 1.4
Liked the puzzle: 2
Did not like the puzzle:
0
|
A game with coins |
Games puzzles |
 |
Weight: 4 |
 |
Liked the puzzle: 100% |
 |
12.03.2011 |
|
Two Megaminds play a game: they have a regular round table and an unlimited
supply of identical round coins. Turn by turn, they place coins on the
table until someone can no longer make a move. The coins cannot
overlay each other, but they can touch. Who has a winning strategy
(and what is it) in this game? |
 |
|
Puzzle statistics "A game with coins".
Last updated 6579395.8 minutes ago.
|
Solved by: 6
Daily average: 0
Answers submitted: 7
Viewed by: 38
Fraction solved by: 15.7%
Solved at first attempt: 83.3%
Average discussion length: 1.3
Liked the puzzle: 1
Did not like the puzzle:
0
|
A game of symmetry |
Games puzzles |
 |
Weight: 4 |
 |
Liked the puzzle: 100% |
 |
17.03.2011 |
|
Two megaminds play a game on a board sized 1x81 cells. The board is initially empty.
At each turn first megamind can place a stone (either black or white) in any cell. Second megamind can either swap any two stones or skip a turn. After megaminds made 81 turns each, the symmetry of the board is assessed. If the stones are located symmetrically, second megamind wins, if not - first one wins. Who will win and why? |
 |
|
Puzzle statistics "A game of symmetry".
Last updated 6579395.8 minutes ago.
|
Solved by: 3
Daily average: 0
Answers submitted: 4
Viewed by: 35
Fraction solved by: 8.5%
Solved at first attempt: 66.6%
Average discussion length: 1.3
Liked the puzzle: 2
Did not like the puzzle:
0
|
A poisoned chocolate bar |
Games puzzles |
 |
Weight: 5 |
 |
Liked the puzzle: 100% |
 |
26.12.2009 |
|
A chocolate bar consists of NxM (at least two) square pieces arranged in a rectangle. The square in the upper left corner is poisoned. Two players break off the squares from the bar and eat them. If a player chooses a certain square, he must also take all of the remaining squares that have row/column numbers not less than the chosen one. A player forced to take the poisoned square loses. Prove that the first player to make a move has a winning strategy. |
 |
|
Puzzle statistics "A poisoned chocolate bar".
Last updated 6579395.8 minutes ago.
|
Solved by: 8
Daily average: 0
Answers submitted: 13
Viewed by: 297
Fraction solved by: 2.6%
Solved at first attempt: 87.5%
Average discussion length: 1.6
Liked the puzzle: 2
Did not like the puzzle:
0
|
Caesar and Brutus |
Games puzzles |
 |
Weight: 5 |
 |
Liked the puzzle: 100% |
 |
26.12.2009 |
|
Two commanders (Caesar and Brutus) conquer a country which forms a connected graph with nodes representing cities and edges representing roads. First, Caesar chooses a city and claims it. Then, Brutus claims any of the remaining cities. Turn by turn, the commanders claim the available cities that are adjacent to the cities they have already claimed. If a commander cannot make a claim, he skips a move. The game continues until all cities have been claimed. Both commanders wish to claim a maximal number of cities. Can Brutus win in this game? |
 |
|
Puzzle statistics "Caesar and Brutus".
Last updated 6579395.8 minutes ago.
|
Solved by: 3
Daily average: 0
Answers submitted: 4
Viewed by: 296
Fraction solved by: 1%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 1
Did not like the puzzle:
0
|
A game with wooden sticks |
Games puzzles |
 |
Weight: 5 |
 |
Liked the puzzle: 100% |
 |
02.01.2010 |
|
Two MegaMinds play a game with 100 wooden sticks. The lengths of the sticks are 1,2,3,...,100 inches. Turn by turn, the players choose three of the remaining sticks which form a triangle, and burn them. The player that cannot make a move loses. Which player has a winning strategy (justify your answer)? |
 |
|
Puzzle statistics "A game with wooden sticks".
Last updated 6579395.8 minutes ago.
|
Solved by: 4
Daily average: 0
Answers submitted: 5
Viewed by: 295
Fraction solved by: 1.3%
Solved at first attempt: 75%
Average discussion length: 1.5
Liked the puzzle: 1
Did not like the puzzle:
0
|
A game with sums |
Games puzzles |
 |
Weight: 5 |
 |
Liked the puzzle: 100% |
 |
03.01.2010 |
|
Two players play the following game. An even number of cards are arranged in a row. Each card is marked with a real number. Upon his turn, a player takes a card from either end of the row. Whoever collects the greater sum is a winner. Otherwise, a draw is declared. Which player is guaranteed not to lose? What is his strategy? |
 |
|
Puzzle statistics "A game with sums".
Last updated 6579395.8 minutes ago.
|
Solved by: 6
Daily average: 0
Answers submitted: 7
Viewed by: 295
Fraction solved by: 2%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 2
Did not like the puzzle:
0
|
The game of 15 |
Games puzzles |
 |
Weight: 5 |
 |
Liked the puzzle: 50% |
 |
20.01.2010 |
|
Numbers 1,2,3,...,9 are written on a piece of paper. Two players cover
these numbers turn by turn using their colored pegs.
A number cannot be covered by more than one peg. The winner should
cover three numbers which add up to 15. If a player covered more than
three numbers, he wins provided that among the covered numbers there
is a triple adding up to 15. Is there a winning strategy in this game?
Which player has it? |
 |
|
Puzzle statistics "The game of 15".
Last updated 6579395.8 minutes ago.
|
Solved by: 8
Daily average: 0
Answers submitted: 10
Viewed by: 280
Fraction solved by: 2.8%
Solved at first attempt: 75%
Average discussion length: 1.6
Liked the puzzle: 1
Did not like the puzzle:
1
|
A game with cells and squares |
Games puzzles |
 |
Weight: 5 |
 |
Liked the puzzle: |
 |
20.01.2010 |
|
Two Megaminds play a game on an infinite rectangular grid. In each
round, the first player traces out a 2x2 or a 3x3 square, and the
second player shades one of the 1x1 cells inside of this square.
Players cannot repeat their moves, i.e. no square can be traced twice
and no cell can be shaded twice. The second player wins if he can make
at least 15 moves, otherwise the first player wins. Who is guaranteed
to win in this games? |
 |
|
Puzzle statistics "A game with cells and squares".
Last updated 6579395.8 minutes ago.
|
Solved by: 2
Daily average: 0
Answers submitted: 4
Viewed by: 280
Fraction solved by: 0.7%
Solved at first attempt: 50%
Average discussion length: 2.0
Liked the puzzle: 0
Did not like the puzzle:
0
|
Page:
1
2
|
|