Brain games: puzzles, riddles, and logical games.
Users rating Registration FAQ

Puzzles, riddles, logical games, mathematics
www.puzzlesriddles.com on Facebook
 

 
Login:
Password:
Remember?
Change password



1. pretorik - 160
2. Gordon Weir, markr - 104
3. mbloomfi - 88
4. zzz123 - 70
5. lidSpelunker - 53
6. Srikanta - 48
7. jkr - 44
8. sunday - 38
9. SAMIH FAHMY - 36
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



Numbers in a square Patterns and correspondences  Weight: 1 Liked the puzzle: 24.12.2011
Place numbers 1,2,.., 9 without repetitions into a 3x3 square so that the sums in all rows, columns, and diagonals are all equal.
Comments:  1 | check your solution  
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.
Comments:  3 | check your solution  
Defective balls Weighing puzzles  Weight: 1 Liked the puzzle: 100% 03.02.2011
A Megamind has ordered a set of steel balls for his scientific experiments: 2 red, 2 orange, 2 yellow, 2 green, and 2 blue. The order was fulfilled but the balls of some color were made 1g lighter than the others. The Megamind has a balance scale that shows the exact weight differential between the two cups. He needs to determine the defective color using one weighing. Please, help the Megamind to do this.
Comments:  1 | check your solution  
Defective pixel Algebra, arithmetic  Weight: 1 Liked the puzzle: 100% 03.01.2010

There is true expression on panel. But only one pixel is defective. Which one?

Press for see in full size.
Comments:  1 | check your solution  
Two villages Knights, Knaves and Jokers  Weight: 2 Liked the puzzle: 100% 27.12.2009
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?
Comments:  4 | check your solution  
Obtain 24 Algebra, arithmetic  Weight: 2 Liked the puzzle: 100% 27.12.2009
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.
Comments:  7 | check your solution  
Numbers on the fence Patterns and correspondences  Weight: 2 Liked the puzzle: 100% 31.12.2009
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?
Comments:  1 | check your solution  
101 coins Weighing puzzles  Weight: 3 Liked the puzzle: 100% 04.01.2010
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?
Comments:  1 | check your solution  
The fifth number Algebra, arithmetic  Weight: 3 Liked the puzzle: 100% 09.01.2010
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.
Comments:  4 | check your solution  
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?
Comments:  4 | check your solution  
12 coins Weighing puzzles  Weight: 4 Liked the puzzle: 100% 03.02.2010
A Megamind has 12 coins, one of which is counterfeit and weighs differently from the others. He has a balance scale, but no weights. How can the Megamind find the counterfeit coin and determine whether it is lighter or heavier than the standard ones? What is the minimal number of weighings required?
Comments:  1 | check your solution  
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.
Comments:  1 | check your solution  
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?
Comments:  1 | check your solution  
The telephone cable 2 Geometry puzzles  Weight: 5 Liked the puzzle: 100% 01.01.2010
The Megamind has a square parcel of land of size 1x1 km. Accidentally, he has found out that the devious Occupants had buried a telephone cable through his land and use it for their devious communications. The cable is buried along a straight line crossing the square land plot. After discovering this, the Megamind got his shovel and... paused to think. What is the shortest trench that the Megamind has to dig to find the cable? The trench may be disconnected. The proof of optimality is not required.
Comments:  3 | check your solution  
A foreign sentry Knights, Knaves and Jokers  Weight: 5 Liked the puzzle: 100% 04.01.2010
You are standing at the road fork. One of the two roads leads to your destination, but you don't know which one. Fortunately, there is a sentry guarding the intersection. Unfortunately, the sentry can be a knight or a knave, moreover, he is a foreigner. He understands you, but when he responds, he says "uhh" or "err" meaning "yes" or "no", but you don't know what means what. He does not say anything else, and he is standing at attention, not being able to point in the right direction. On top of all this, the sentry is somewhat dumb, i.e. he cannot understand sentences longer than 13 words. You may ask a single question to figure out which way to go. Which question should you ask?
Comments:  1 | check your solution  
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.
Comments:  3 | check your solution  



 
Users online 1: administrator -  administrator  moderator -  moderator  VIP user -  VIP user  user -  user
drimacus 19  |
www.puzzlesriddles.com © 2006-2010 All Rights Reserved