 |
| 1. |
markr |
- |
100 |
| 2. |
monkeyspike |
- |
28 |
| 3. |
Pai, Srikanta |
- |
25 |
| 4. |
M_87 |
- |
24 |
| 5. |
mgritter |
- |
17 |
| 6. |
mathislife22 |
- |
13 |
| 7. |
lessthanepsilon |
- |
12 |
| 8. |
Azrail |
- |
9 |
| 9. |
Muni |
- |
8 |
| 10. |
JK |
- |
7 |
|
 |
 |
 |
| 1. |
alan |
- |
176 |
| 2. |
denisR |
- |
167 |
| 3. |
idler_ |
- |
104 |
| 4. |
tolstyi |
- |
55 |
| 5. |
vale |
- |
32 |
| 6. |
STARuK |
- |
9 |
| 7. |
Mosk |
- |
2 |
| 8. |
Black, kshor, Mouse, sergeip, xandr |
- |
0 |
|
 |
 |
|
|
|
| A Megamind has two bags and 100 M&Ms. He needs to put all the nuts
into the bags so that one bag has twice as many
M&Ms as the other. He cannot split the M&Ms. What should the Megamind do? |
 |
|
|
Puzzle statistics "A 100 M&Ms".
Last updated 71786.2 minutes ago.
|
Solved by: 10
Daily average: 0.14
Answers submitted: 12
Viewed by: 26
Fraction solved by: 38.4%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 3
Did not like the puzzle:
0
|
|
|
| You have 8 coins that appear to be identical, except one (which is
counterfeit) is slightly heavier than the others. What is the
minimal number of weighings on the balance scale that is required to
find the counterfeit coin? |
 |
|
|
Puzzle statistics "8 coins".
Last updated 71786.2 minutes ago.
|
Solved by: 12
Daily average: 0.16
Answers submitted: 13
Viewed by: 26
Fraction solved by: 46.1%
Solved at first attempt: 91.6%
Average discussion length: 1.2
Liked the puzzle: 4
Did not like the puzzle:
0
|
|
|
| A Megamind is lost in the mountains. He is standing on a path,
shouting for help.
Finally, he sees a local approaching. Megamind knows that the locals
can be knights that always tell the truth, or knaves that always lie.
He also knows that the path leads to the village of knights in one
direction and to the village of knaves in the other. The problems is
that the knaves are also hateful of Megaminds, and will stone him if
gets to their village. How can Megamind ask one question and determine
the right way to go? |
 |
|
|
Puzzle statistics "Two villages".
Last updated 71786.2 minutes ago.
|
Solved by: 6
Daily average: 0.07
Answers submitted: 7
Viewed by: 27
Fraction solved by: 22.2%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 2
Did not like the puzzle:
0
|
| Two cubes and labels |
Logic puzzles |
 |
Weight: 2 |
 |
Liked the puzzle: 100% |
 |
19.01.2010 |
|
| You have two cubes and sufficiently many labels with digits
0,1,2,..,9. You have to place one label on each face of each cube so
that you can describe any day of the month. The days 1,2 .., 9 should
be described as 01,02,...,09. |
 |
|
|
Puzzle statistics "Two cubes and labels".
Last updated 71786.2 minutes ago.
|
Solved by: 5
Daily average: 0.09
Answers submitted: 6
Viewed by: 12
Fraction solved by: 41.6%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 4
Did not like the puzzle:
0
|
| 50 coins |
Logic puzzles |
 |
Weight: 3 |
 |
Liked the puzzle: 100% |
 |
27.12.2009 |
|
| Once upon a time, a tsar was holding a reception and the Megamind was
among the guests. The tsar decided to test how smart the Megamind was,
took him into a dark room, and gave the following task: On the table
in this room, there are 50 coins, exactly 10 of them are tails up. In
the darkness, it is impossible to determine the sides of these coins.
Touching the coins also does not help. The Megamind has to separate
these coins into two groups so that the number of tails in both are
equal. Can he do it? |
 |
|
|
Puzzle statistics "50 coins".
Last updated 71786.2 minutes ago.
|
Solved by: 8
Daily average: 0.1
Answers submitted: 8
Viewed by: 27
Fraction solved by: 29.6%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 3
Did not like the puzzle:
0
|
|
|
| Among 101 coins, exactly 50 are counterfeit. A counterfeit coins
weighs one gram more or gram less than the real coin (counterfeit
coins may weigh differently). You have a balance scale that shows the
exact weight differential between the two cups. How can you
determine whether a given coin from this set is counterfeit using the
scale only once? |
 |
|
|
Puzzle statistics "101 coins".
Last updated 71786.2 minutes ago.
|
Solved by: 6
Daily average: 0.08
Answers submitted: 6
Viewed by: 24
Fraction solved by: 25%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 2
Did not like the puzzle:
0
|
| A Megamind in a boat |
Geometry puzzles |
 |
Weight: 4 |
 |
Liked the puzzle: 100% |
 |
27.12.2009 |
|
| A Megamind is sitting in a boat at the center of a circular lake of
radius R. On the lake shore, an evil Goblin awaits. Luckily for the
Megamind, the Goblin can only move along the shore. Unfortunately, the
Goblin is 4 times as fast as the Megamind in his boat. The Megamind
can save himself if he gets to the shore and evades meeting with the
Goblin. Can the Megamind save himself? If yes - how? |
 |
|
|
Puzzle statistics "A Megamind in a boat".
Last updated 71786.2 minutes ago.
|
Solved by: 3
Daily average: 0.03
Answers submitted: 4
Viewed by: 27
Fraction solved by: 11.1%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 1
Did not like the puzzle:
0
|
|
|
| What is the minimal number of straight cuts required to split a 3x3x3
cube into 27 1x1x1 cubes? Pieces can be rearranged arbitrarily between
the cuts. The answer should justify the minimality. |
 |
|
|
Puzzle statistics "Cutting the cube".
Last updated 71786.2 minutes ago.
|
Solved by: 6
Daily average: 0.07
Answers submitted: 7
Viewed by: 27
Fraction solved by: 22.2%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 3
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 digraph 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 71786.2 minutes ago.
|
Solved by: 2
Daily average: 0.02
Answers submitted: 2
Viewed by: 27
Fraction solved by: 7.4%
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 71786.2 minutes ago.
|
Solved by: 2
Daily average: 0.02
Answers submitted: 3
Viewed by: 26
Fraction solved by: 7.6%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 1
Did not like the puzzle:
0
|
|
|