 |
| 1. |
pretorik |
- |
160 |
| 2. |
Gordon Weir, markr |
- |
104 |
| 3. |
mbloomfi |
- |
88 |
| 4. |
zzz123 |
- |
70 |
| 5. |
lidSpelunker |
- |
53 |
| 6. |
Srikanta |
- |
48 |
| 7. |
SAMIH FAHMY |
- |
45 |
| 8. |
jkr |
- |
44 |
| 9. |
sunday |
- |
38 |
| 10. |
danger2society |
- |
35 |
|
 |
 |
 |
| 1. |
denisR |
- |
236 |
| 2. |
alan |
- |
231 |
| 3. |
dddfff |
- |
228 |
| 4. |
De_Bill |
- |
226 |
| 5. |
kavfy |
- |
221 |
| 6. |
idler_ |
- |
106 |
| 7. |
akajobe |
- |
94 |
| 8. |
tolstyi |
- |
56 |
| 9. |
vale |
- |
31 |
| 10. |
xandr |
- |
11 |
|
 |
 |
|
|
|
| Place numbers 1,2,.., 9 without repetitions into a 3x3 square so that
the sums in all rows, columns, and diagonals are all equal. |
 |
|
|
Puzzle statistics "Numbers in a square".
Last updated minutes ago.
|
Solved by:
Daily average:
Answers submitted:
Viewed by:
Fraction solved by: %
Solved at first attempt: %
Average discussion length:
Liked the puzzle:
Did not like the puzzle:
0
|
| Links and chains |
Logic puzzles |
 |
Weight: 1 |
 |
Liked the puzzle: 100% |
 |
02.04.2011 |
|
| Once upon a time, a Megamind worked as a smith. He was brought 5
chains each consisting of 3 links. What is the minimal number of links
that the Megamind should re-lock to make one long chain? |
 |
|
|
Puzzle statistics "Links and chains".
Last updated minutes ago.
|
Solved by:
Daily average:
Answers submitted:
Viewed by:
Fraction solved by: %
Solved at first attempt: %
Average discussion length:
Liked the puzzle:
Did not like the puzzle:
0
|
|
|
There is true expression on panel. But only one pixel is defective. Which one?
|
 |
|
|
Puzzle statistics "Defective pixel".
Last updated 614579 minutes ago.
|
Solved by: 94
Daily average: 0.1
Answers submitted: 129
Viewed by: 294
Fraction solved by: 31.9%
Solved at first attempt: 94.6%
Average discussion length: 1.2
Liked the puzzle: 23
Did not like the puzzle:
0
|
| Two incense sticks |
Logic puzzles |
 |
Weight: 1 |
 |
Liked the puzzle: 100% |
 |
27.12.2009 |
|
| You have two incense sticks, that burn unevenly, and a lighter. Each
will burn for an hour. How can you time 45 minutes using nothing but
these tools. |
 |
|
|
Puzzle statistics "Two incense sticks".
Last updated 614579 minutes ago.
|
Solved by: 41
Daily average: 0.04
Answers submitted: 53
Viewed by: 296
Fraction solved by: 13.8%
Solved at first attempt: 92.6%
Average discussion length: 1.1
Liked the puzzle: 10
Did not like the puzzle:
0
|
|
|
| A Megamind walked along a fence and discovered strange pairs of
numbers. First, he saw "188->4". A bit fаrther, he discovered
"232->0". A few steps after that, "100->2". Then, "163->1". Then he
saw a little boy who was just beginning to paint something. When the
Megamind called a boy, he ran away. Approaching the site, the Megamind
saw an incomplete pair "386->...". He took out his favorite marker and
completed the pair. What number did he write? |
 |
|
|
Puzzle statistics "Numbers on the fence".
Last updated 614579 minutes ago.
|
Solved by: 20
Daily average: 0.02
Answers submitted: 22
Viewed by: 295
Fraction solved by: 6.7%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 8
Did not like the puzzle:
0
|
|
|
| Using numbers 1,3,4,6, and basic arithmetic operations (addition,
subtraction, multiplication, and division) and parentheses, obtain and
expression that evaluates to 24. You may use only these numbers and
only these operations. Every number should be used exactly once.
Numbers cannot be concatenated, i.e. you cannot use 13 or 146. |
 |
|
|
Puzzle statistics "Obtain 24".
Last updated 614579 minutes ago.
|
Solved by: 48
Daily average: 0.05
Answers submitted: 55
Viewed by: 296
Fraction solved by: 16.2%
Solved at first attempt: 87.5%
Average discussion length: 1.2
Liked the puzzle: 12
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 614579 minutes ago.
|
Solved by: 37
Daily average: 0.04
Answers submitted: 47
Viewed by: 296
Fraction solved by: 12.5%
Solved at first attempt: 83.7%
Average discussion length: 1.4
Liked the puzzle: 10
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 614579 minutes ago.
|
Solved by: 22
Daily average: 0.02
Answers submitted: 30
Viewed by: 296
Fraction solved by: 7.4%
Solved at first attempt: 90.9%
Average discussion length: 1.2
Liked the puzzle: 8
Did not like the puzzle:
0
|
|
|
| The set of numbers 1,3,8,120 has a remarkable property: the product of
any two numbers is a perfect square minus one. Find a fifth number
that could be added to the set preserving its property. |
 |
|
|
Puzzle statistics "The fifth number".
Last updated 614579 minutes ago.
|
Solved by: 37
Daily average: 0.04
Answers submitted: 41
Viewed by: 291
Fraction solved by: 12.7%
Solved at first attempt: 97.2%
Average discussion length: 1.1
Liked the puzzle: 11
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 614579 minutes ago.
|
Solved by: 15
Daily average: 0.01
Answers submitted: 16
Viewed by: 293
Fraction solved by: 5.1%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 4
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 614579 minutes ago.
|
Solved by: 6
Daily average: 0.01
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
|
|
|
| After a shipwreck, a MegaMind found himself on an island where some natives always lie and some always tell the truth. As a ritual, all natives stood in a circle facing the center, joined their hands and everybody told the MegaMind whether his right hand side neighbor is a liar or a truth-teller. Based on this information, the MegaMind was able to determine the exact percentage of natives that tell the truth.
Can you also determine this percentage? |
 |
|
|
Puzzle statistics "A circle of lies".
Last updated 614579 minutes ago.
|
Solved by: 9
Daily average: 0.01
Answers submitted: 10
Viewed by: 284
Fraction solved by: 3.1%
Solved at first attempt: 77.7%
Average discussion length: 1.8
Liked the puzzle: 2
Did not like the puzzle:
0
|
| Six matches and triangles 2 |
Geometry puzzles |
 |
Weight: 4 |
 |
Liked the puzzle: 100% |
 |
07.02.2010 |
|
| How to make one equilateral and three isosceles (and not equilateral!) triangles using 6 sticks of the same length? Sticks cannot be broken and/or laid over each other and no free ends of the matches may be left. |
 |
|
|
Puzzle statistics "Six matches and triangles 2".
Last updated 614579 minutes ago.
|
Solved by: 5
Daily average: 0
Answers submitted: 15
Viewed by: 273
Fraction solved by: 1.8%
Solved at first attempt: 40%
Average discussion length: 2.2
Liked the puzzle: 3
Did not like the puzzle:
0
|
 |
|
|
| Once upon a time, a Megamind worked as an optometrist for an Occupier
who was color blind. The Occupier had a dream that he may regain
perfect vision if the Megamind made him a set of 9 red and 9 blue
crystals. The crystals should be of the same size,
but the blue ones should be heavier than the red ones. Crystals of the
same color should weigh the same. The Megamind completed the order and
brought two sets of crystals: blue in his right hand and red in the
left. The Occupier was suspicious, he did not trust the Megamind.
Fortunately, the Occupier has a balance scale. How can the Megamind
convince the Occupier that all crystals in one hand are blue and in
the other - red. He can use no more than three weighings. |
 |
|
|
Puzzle statistics "18 crystals".
Last updated 614579 minutes ago.
|
Solved by: 3
Daily average: 0
Answers submitted: 4
Viewed by: 295
Fraction solved by: 1%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 1
Did not like the puzzle:
0
|
|
|
| For which values of n, the decimal number 10101..01 (the alternating sequence of n ones and n-1 zeros) is a prime? |
 |
|
|
Puzzle statistics "10101...01".
Last updated 614579 minutes ago.
|
Solved by: 5
Daily average: 0
Answers submitted: 12
Viewed by: 273
Fraction solved by: 1.8%
Solved at first attempt: 60%
Average discussion length: 1.4
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 614579 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
|
|
|