instruction stringlengths 32 29.2k |
|---|
I got a 3D wooden puzzle in which you are supposed to rebuild. I took pictures of the 6 pieces (click images to enlarge):
I found this image on the Internet. I believe it's the solved version:
How do you solve it? Has anybody here done it?
|
You are an intrepid explorer who has been caught in a trap by a primitive tribe. They lock you in a room with no exit but one door. The door has a pressure sensitive release - incorrect pressure ($>0g$) will cause immediate death. There are 10 piles each of 20 heavy stone discs (200 in total). You know what each disc ... |
You are in a room with a barrier in the middle. This is not a physical barrier; it is a dividing line of 2 mirror images. When you look across the room, it appears to be a mirror because you see a mirror image of yourself and other objects in the room, but the mirror is not made of any substance. It is simply a point w... |
This is taken from a riddle book:
Val, Lynn and Chris are related to each other, but no incestuously.
Among the three are Val's father, Lynn's only daughter, and Chris' sibling.
Chris' sibling is neither Val's father nor Lynn's daughter.
Which one is a different sex?
|
Mama snake wants to knit a blanket for little baby snake.
She is not a dissipater and wants to make the blanket of a minimal size (area). But her baby snake is quite a lively baby and it always twists and stretches and turns around while sleeping.
If the baby changes position or from, mama takes the blanket and puts it... |
What is the meaning of the following characters?
13579 vs U
|
Take a look at these letters and tell me what it means.
"T_RN"
It's a bit of a brainteaser. So think outside of the box to get the answer.
|
Can anyone tell me what this secret message is?
EVARELTO
Try finding the secret message represented by these letters.
|
A secret message is hidden in the below letters
DDDWESTDDD
Tell me what the message is if you can find it out.
|
One day a treasure hunter was searching for treasure on an abandoned island. He got tired of looking everywhere, so he walked towards a big tree that he saw in order to rest in its shade.
As he approached the tree, he saw a board hanging on the tree. This was written on the board:
PETS A
He understood that it was a ... |
A man works at an aquarium. Every day, he has to spend way too much time telling people to stop tapping on the glass at the shark tank. Finally, he gets fed up with it and comes up with a solution.
Thankfully, the solution works perfectly, because the next day, nobody tapped on the glass. At the end of his shift, tho... |
A man was murdered in his office bathroom. Detective Troby found a paper with alphabets written as below from the pocket of the dead man's corpse.
____________________________
| |
| abcdefghijkmnopqrstuvwxyz |
| |
----------------------------
Troby inspected the... |
One day, I was waiting to get on the subway. I was eating the apple I always have for breakfast, and I decided to sit next to a homeless man on the bench. We saw a rather... rotund man walk by us, to which the hobo muttered, "Pig."
I didn't give it a second thought, except how rude the comment was. Another man walked... |
The image below carry a hidden message. The image alone is not enough, you'll need to use the hints to uncover the hidden message. All the information needed to solve the puzzle is already given (as in no outside source needed).
Hint:
On the first day, the first sacrifice follow his family here while the others come a... |
I just came up across this question in the mathematics stack exchange site and found it quite interesting:
100 autonomous robotic vehicles enter a warehouse in random order to park. Inside the warehouse, there are 100 sequential parking spaces enumerated from 1 to 100. Each vehicle has an assigned number where it will ... |
You, a young adventurer, are travelling through the forest. Suddenly, your path splits in 2. You have no map or compass - well, you do but your compass is broken. You know you have to keep travelling North, so how can you tell which direction to go in? You do not have much time, you must leave now!
Where are you going ... |
You roll 5 dice and I'll always be able to give a number uniquely-defined by the numbers on the dice. You have to figure out how it works, without looking it up. Here's a couple example rolls:
1,2,3,4,5 = 6
3,6,2,3,1 = 4
Please only answer if you figured it out yourself.
Also note that the name is especially important.... |
Each of the 50 robots move around in a room. The room is 8 by 8 tiles long. Each bot takes up 1 tile. On each turn they move like the knight in Chess, they don't teleport, they move. They all move at the same speed. When they knock into eachother they stop. They cannot move into a wall, they are Pre-programmed to avoid... |
Suppose 9 men take 9 hours to dig 9 holes in the ground.
(a) How many hours would it take 3 men to dig 3 holes?
(b) How many men would it take to dig 54 holes in 54 hours?
|
I heard from a clever person that for the problem mentioned before: I don't know the two numbers... but now I do a solution exists even if we change 100 to infinity.
So the formulation would be next:
Two perfect logicians, Summer and Proctor, are told that integers x and y have been chosen such that $x>1$ and $y>1$. S... |
How far down the rabbit hole of not knowing can we go? While working on the generalization of I don't know the two numbers... but now I do, I thought of these two extensions. Both have the same conditions, but a different conversation taking place:
Conditions:
Two perfect logicians, Summer and Proctor, are told that i... |
This is sorta like How to ship the new Slurm 7-pack efficiently by Matt Malone but instead of 7, it's the 9 pack! It's basically a 2 by 4 pack with a piece sticking out, like in the above link. What's the smallest version rectangle that you can make with the described shape, solution with the least packs gets best solu... |
In an alternative universe where the following is true:
1 # 1 = 3
2 # 2 = 7
1 # 2 = 5
What would ? be?
5 # 5 = ?
YOU DO NOT NEED THE FOLLOWING TO FINISH.
Extra equations:
3 # 3 = 11, 4 # 4 = 15
|
How many queens can be placed in a standard $8*8$ chessboard to threaten each of them exactly once by other queens?
|
Standard knights and knaves problem. There are 10 people in a room, you know that each person will either always tell the truth or always lie, but you don't know who is a truth teller or liar.
You are in a room with 5 doors. Four of the doors lead to horrible hazards like an endless pit, a fiery inferno, or being f... |
The one who made it didn't want it
The one who bought it didn't need it
The one who received it didn't wish for it
The one who used it never saw it
What was it?
|
You have a stack of N cards numbered from 1 to N in random order.
You want to sort the cards in ascending order using the following procedure:
Your initial stack is stack 1.
You distribute the cards from stack 1 to stack 2 and 3: you take the topmost card on stack 1, put it on top of stack 2 or stack 3, and repeat unt... |
My friend sent me his puzzle: it's S2LQEQnXk4DP+WsyP1aURD+lz4JSteeOPz3tO7Yiu1dv5fFCr31uegHUpVGqyXk7WjX95TDALus8Gj6nnoGHwj0MLE2AfpB2KTQEIxVvGMyun2XLb+PTcqzVAoFQLr48 in binary, and it came with two hints: "PooP" and "3 6 4 2 5 -5 -4 -6 0 -5".
We have been giving each other these puzzles for a time now and they have been ... |
I am a seven letter word. If you remove one letter from me my meaning does not change. If you remove two letters from me my meaning still does not change, and if you remove three letters from me, my meaning still does not change.
Even if you remove all letters my meaning won't change. What word is this?
|
Say, you are given a cake which you must share with 7 others. So, you must cut the cake into 8 pieces. But, you are only allowed to make 3 straight cuts. You cannot move pieces of the cake after the first cut.
|
You should see a standard chessboard - it is printed on paper. How many ways can you cut it up (around the squares) such that each piece has twice as many squares of one colour than of the other colour?
|
Similarly to this question: How many Queens to threaten themselves.
What it the maximum number of queens you can place on an 8*8 board such that each queen is attacked precisely twice:
with no other pieces on the board?
other pieces are allowed?
I thought this was a legitimately interesting variation and it seems to ... |
You are given 4 balls, all equal in weight except for one that is either heavier or lighter. You are also given a two-pan balance to use. In each use of the balance you may put any number of the 4 balls on the left pan, and the same number on the right pan, and push a button to initiate the weighing; there are three po... |
We're on the middle of the most devastating war the Earth has gone through all its history. You and your brother in arms are in a plane that has been taken down while crossing the enemies lines. You are okay, but your teammate has a head contussion and must be immediately brought back to your base.
Luckily, you are suc... |
The little old man has twelve children: some short, some long, some cold, some hot.
Who is he?
|
Warning: To answer this riddle you need to have a thorough understanding of how time works.
Two twins were born during the same year, on the same month, and the same day, exactly 10 minutes apart. By the time twin A was 100, twin B was younger by more than 10 minutes, fairly slightly. Neither twin died during the 100 ... |
Queen is combination of Bishop and Rook and Amazon is combination of queen and knight.
The question is how many Amazons can place on a standard chessboard that non of them attack each other without any other pieces allowed?
Hint:
It's obvious that it should be a smaller number than 9. Also 8 is impossible too. Becaus... |
How many knights can you fit on a chess board without any being threatened?
|
How many squares can you control with only one set of chess pieces of the same color? (8 Pawns, 2 Knights, 2 Bishops, 2 Rook, Queen and King)
Edit: Pieces cannot attack (control) the square they are currently occupied.
|
Is it possible to order a complete set of chess pieces of the same color (8 Pawns, 2 Knights, 2 Bishops, 2 Rook, Queen and King) in such a way that none of them attack each other? If so, how?
|
Similar to How Many Knights on a Chess Board? however speedy knights move the way the knight moves, then the way the knight moves AGAIN. However they cannot backtrack to their starting position. How many can you place on a board so to as none are being threatened.
For example, this 1 speedy knight, attacks all these ki... |
You may only use pieces in the original set, and all your pieces must be the same color. The king is not allowed. Pawns do not get promoted. Pieces do not control the square they occupy.
Accepted Answer goes to the person that has the least score.
Piece cost:
Pawn - 1
Knight - 3
Bishop - 3
Rook - 5
Queen - 9
|
Pirates have buried treasure on a very unusual perfectly circular desert island, with no trees or obstacles of any kind. The map takes me to the island but doesn't tell me where to find it on the island.
It only tells me that it's buried under a small x marked on the ground.
The tide is coming in fast so I have to fin... |
How many pieces can you organize on a Chess board without one side being attacked by the other? This scoring will be used to prove you have the highest.
Piece cost:
Pawn - 1
Knight - 3
Bishop - 3
Rook - 5
Queen - 9
Rules:
Both sides must have the same pieces on the board
Your score is totalled by only 1 side
One col... |
I was helping Ernie clean out his shed a while back when I saw a curious old machine. "Oh yeah, that!" said Ernie, when I pointed it out to him. "A few years back, before transistors were invented, I tried to make a clockwork calculator. It worked, but was never a commercial success." The machine consisted two rows of ... |
Ok, so my friends and I had a disagreement over this seemingly simple problem and we would very much like to know the answer for it.
Question
Initially a 100 kgs watermelon is 96pc water and 4pc pulp. After keeping it out in the sun for (say X) hours, the watermelon is now 95pc water. What is the weight of the waterme... |
A wealthy person has passed away, naming three siblings as beneficiaries of the vast estate. Unfortunately, the will states that:
My estate shall be divided evenly, such that no sibling shall feel their share is smaller than any other share.
As the estate contains many illiquid assets of sentimental value, one cannot... |
You may use as many pieces as you like. Pieces do not control the square they occupy.
Accepted Answer goes to the person that has the least score.
Piece cost:
Pawn - 1
Knight - 3
Bishop - 3
Rook - 5
Queen - 9
Note1: The king has no score, it was implied that it is not allowed.
Note2: I meant to imply only 1 colour wa... |
The Bunny is a new chess piece. It can move in 2 different ways: Diagonally, but only exactly one space (so like a bishop with the limitations of a king). It can also "Bunny-Hop" over another bunny. Here's an explanation of how this is done:
Let's say that, in the following image, the white bishop is a bunny named Henr... |
The maximal number of knights of a single color that can be placed on a chessboard without any knight being one knights-move away from any other is 32; such a position may easily be achieved by placing all 32 knights on squares of the same color.
If one uses both black pieces and white pieces, it's possible to place 24... |
Heaven has a countably infinite number of cloud for people to stay, each of which has a good soul living on it.
A countably infinite number of infinite universes are extinguished by God (their beta period had expired). So, a countably infinite number of groups of good souls (each of which are countably infinite in size... |
For the following pattern of filling the $5*5$ matrix, how many steps does it take to turn all cells of the matrix to black?
Pattern has revealed by eBusiness:
The first piece moves to the right, the second moves down, the third moves left, the fourth moves up, and so the fifth probably moves right.
The letters... |
No restriction on number of pieces of each type, but all pieces must be the same color. Pieces do not control the square they occupy.
The pieces on the chessboard must, through their combined efforts, control every square on the board. Accepted Answer goes to the answer with the lowest score.
Piece cost:
Pawn - 1
Knig... |
Let's say there is a 5x5 grid with a starting position in the upper left corner, and an ending position is lower left corner. How do I count how many Hamiltonian paths there are through the grid?
I know the answer is 86 for a 5x5 grid. But how should I calculate this? (4x4 is 8, 3x3 is 2) I want to learn calculate lar... |
I made up this puzzle, so if you are only keen on answering standard puzzles, I am sorry, I thought its been a dull day for questions so I made up my own
Here is a 7 x 7 squares image with 7 8 letter English words hidden in it can you find the words?
The conditions to be followed are
The first letter of one word has t... |
The Numberplay blog on the NY Times website used to have word ladder puzzles along with their weekly math puzzles. I found them fun and so I figured I'd introduce them here. These aren't just your basic word ladders either.
You can change a single letter in place, as in traditional word ladders — for example, SOAP t... |
Two girls went to dinner together and both ordered iced tea. One girl pounded down five of them in about a minute, and the other took her time drinking one.
The girl who drank one died, while the girl who drank five survived. However, all of the drinks that were served turned out to contain poison.
Why did the girl t... |
An old farmer passes away in his sleep. After a suitable period of mourning, his three sons find their father's will in his study.
Amongst other, simpler bequests is the following:
"I wish my small flock of sheep to be well cared for, with the responsibility split between my three suns. Therefore take the pack of cards... |
You must create a sentence that is grammatically correct, each word must begin with the last letter in the word before. The first word must start with the last letter of the last word. This sentence must be at least 4 words long.
|
Is it possible to setup a chess board where every square on the board is only controlled once. Occupying a square does not mean controlling it.
If it is possible, with how little pieces?
Piece Cost:
Pawn: 1
Bishop: 3
Knight: 3
Rook: 5
Queen: 9
You are not allowed to use the king.
|
A traveller decided to explore a square desert. He started from a point on the edge to point B, travelling perpendicular to the edge of the desert he started on.
On reaching B, he then decided to take a 90 degree turn to travel to point C, where he spent the night.
The next day he was told that he could go straight an... |
Using only the one colour set; Is it possible to setup a chess board where every square on the board is only controlled once. Occupying a square does not mean controlling it.
If it is possible, with how little pieces?
Piece Cost:
Pawn: 1
Bishop: 3
Knight: 3
Rook: 5
Queen: 9
You are not allowed to use the king.
All pa... |
okay this is the scenario this time;
A rebel member was captured in order to intercept a message. There are several items he was carrying on him; his wallet, house key, an old mobile phone, and 5 piece of papers (as shown below). Figure out what is the message he was carrying.
There's something else needed to so... |
This is the problem I came across reading the book The Art and Craft of Problem Solving. When I read this question I wasn't able to figure out the solution and I saw the solution after a while, but still I couldn't understand the solution as well.
Question:
Pat wants to take a $1.5$-meter-long sword onto a train, but ... |
What is the complete set of 10-digit numbers using each value ($0$-$9$) once, such that the first $n$ digits form a number divisible by $n$ (for $n \in \{1,2,...,10\}$)?
E.g. if the number were $1234567890$, $1$ must be divisible by $1$, $12$ must be divisible by $2$, $123$ must be divisible by $3$, etc...
|
Please note I realize there could be many "correct answers" but I'm looking for a specific one.
1, 3, 5, 4, 2, 7, 6, 8, 9, 3, 4, 5, 8, 2, 9, 3, 5, 2, 42, 35, 42, 52, 55, 52, 109, 85, 120, ?, ?, ?
Hint:
It has to do with multiplying, each "part" being multiplied, is multiplied by the part before it.
Hint2:
Split it u... |
Knowing the solution I consider this pattern as a quite beautiful.
Find the pattern:
HH,EL,IB,EB,CN,OF,NE,NA,MG,AL,SI,PS,CL,AR,KC,AS,CT, ...
|
The non-negative integers are divided into three groups as follows:
A = {0,3,6,8,9...}, B = {1,4,7,11,14...}, c={2,5,10,13...}
Explain ? I have no idea how to proceed.
|
In regular chess no piece can checkmate the opposite king alone (i.e. without the help of his allied king). But a Maharajah can.
Is there a piece weaker than the Maharajah, of course invented, that can force checkmate on the opposite king alone?
Is there a piece weaker than the Maharajah, of course invented, that can... |
Does anyone knows the name of the puzzle showed in the image below?
The objective is to mount a 3x3x3 cube such that all sides of this cube are equal. The small cubes of the image are linked by an elastic and some of them can rotate along this link.
|
You are on the final round of a TV gameshow, there are 3 doors; A, B and C. Two doors lead to a goat and the other door leads to a sports car.
In each episode the presenter asks the contestant to select a door. He then opens one of the unselected doors to show a goat, the contestant is allowed to change their mind and ... |
Have you seen Knight-Knave puzzles based on probability rather then facts?
For example a puzzle with condition like this: Knight tells the answer, probability to which according to his knowledge is large that 50%. Knave - the opposite. So to the question "Will a dice show 1 or 2?" knight answers "No" and Knave "Yes".... |
Here's a pretty easy one.
A new student (a male) was wandering down the hall of his new school looking for the boys' locker room. He asks a nearby student (who happens to be the school bully) to direct him. The bully says, "See those three doors? It's one of those, but I switched the signs around so they're all wrong... |
You are at an impasse with 30 doors - 29 of them lead to endless wandering the depths of hell - and one of them leads to paradise. In front of them stand the typical trio of good friends, a Knight, a Knave and a Joker. A Knight always gives answers truthfully. A Knave always gives the answer opposite to what a Knight w... |
After every time you guess, you're told if you're right, too high, or too low. Is there a strategy you can use to guarantee you'll get it on your 6th attempt (or lower)?
I know a strategy to get it on your 7th attempt.
|
N bishops are placed on a standard 8x8 chess board.
Each bishop can move normally but after touching or moving over an square, that square is considered marked. A bishop cannot pass over or land on a marked square again.
Each bishop may stop any number of times.
What is the minimum number (N) of bishops required to ma... |
Following these questions: Faulty computers, Knights and jokers I wonder, what if the conditions are the following:
We have T Knights (truth-tellers), L Knaves (liars) and R Jokers (random-tellers). $T > 0$. We know all 3 numbers, but we do not know who is who.
We can chose any two of them and ask the first about th... |
You're on a game show, playing for 1 million dollars! You've made it to the final round, there are 4 doors, you pick a random door (obviously, there's a 1/4 chance for all of them, let's say you picked #3.) The host reveals door #1, it's empty. You now have the choice to stick with your door, switch to another door, or... |
A variation of the Monty Hall, where the values inside the choices are changed
You were just out gambling and lost 5000 dollars! Of course being the gambler that you are, you pay 2500 to play this game known as the "three boxes" You decide to play this because you're chances of getting the money back is 2/3! One box co... |
You've gotten in trouble with a Mob Boss, and as punishment have been brought to a sandy beach. You're ordered by him at gunpoint to bury yourself in the sand up to your neck. He specifies a spot that will have you drowning when the tide comes in. You have no way to contact any outside help, and you cannot overpower... |
You find yourself in the usual situation with three locals whose answering is highly restricted. First, they can only answer yes or no questions. Second, one will always answer truthfully, one will always lie (answer the opposite of the truth), and one gives answers that are completely unconstrained - might be random, ... |
A very old man has a million dollars, which he's going to pass down to you! He has 3 associates who have been ordered to help you. The 3 associates know the location where it is, and they tell you it is in either a) a box, b) a safe, or c) a hole.
One of the associates always tells the truth, one always lies, the third... |
I would like to try more strict conditions for puzzle, which frodoskywalker solved so simply. Basically all the same, but only one type of questions is allowed.
We have T Knights (truth-tellers), L Knaves (liars) and R Jokers (random-tellers). $T > 0$. We know all 3 numbers, but we do not know who is who.
We can cho... |
Inspired by 6 Tries to Guess a Number Between 1-100, how many guesses would it take if you can ask if the outcome of an operation is equal, less than, or more than a number.
In other words, Alice picks a number $x$ such that $1\leq x \leq 100$ and her friend Bob asks $f(x) \overset{?}{=} y$ to which Alice may only resp... |
You get get 6 attempts to find the number between 1-100. Each "attempt" can either be a guess, or a range it could fall in, responses you could receive are "Correct!", "My number is lower.", "My number is higher", or "My number is within that range".
You have 6 tries to guess it, NOT to know it.
If you can do it in les... |
I found this question and became curious, can anyone tell me the answer and prove it, i know it seems fairly simple but just thought an explanation of this would make an interesting case.
Flip a fair coin repeatedly until you get two heads in a row (HH assuming H indicates head and T indicates Tails). On average, how m... |
You are a bank robber, and you come across a safe. It has a combination lock of 4 digits. Careful research (and stealing papers at the bank) has given you multiple clues as to the code - just barely enough to figure it out.
Digits are referred to as A-B-C-D in the clues. "A + B" is the sum of the first and second digit... |
I was helping Ernie out in his shed a while back, when his favorite screwdriver suddenly wore out. I offered to go and pick up a new one for him and Ernie thought it was a great opportunity to test-drive his new electric car.
Ernie's car is a work in progress. The body of the car is a rectangular prism exactly 2 m lon... |
After the last bank encounter, you decide that you could make a living off of just cracking codes (as if robbing banks wasn't enough). A shady man meets you on a park bench and slides you an envelope, dramatically. It contains clues for the next number.
Crack the Code #1
Digits are referred to as A-B-C-D in the clues. ... |
A male friend of yours wants to test if you are ok at Math and logical thinking, he says I am one of two children of my parents, and asks you to find out the probability that his sibling is a sister, he carefully also states he wants you to assume a sex ratio of 100 boys to 100 girls and that they were not twins.
|
I was having a house-leaving party at my old house, and challenged four of my friends to guess the number of the new address, which had three digits.
The responses I got were 280, 376, 304, and 370.
I was amused, as each one of them got one digit correctly and in its right place, while the other two digits of each ... |
You were on a grocery shopping day, you go to the store, and your friend tells you he'd like you to pick him up some fruit, naturally you try and be a kind friend and agrees to pick it up for him, you ask him what he wants and he replies:
"Alright, I need some apples and oranges, I'd like 3 of each, but if there's only... |
A friend of mine made a simple bar bet, in which he wrote down a list of ten words. Turning it around to show me, he covered up the first two words with his hand. The eight words below his hand were the following:
THIRD
FOURTH
FIFTH
SIXTH
SEVENTH
EIGHTH
NINTH
TENTH
He bet me \$20 that I would not be able to guess the... |
What does this mean?
"The girl that a man that a dog that a complex that a landlord that a friend that a cat plays with helps owns houses loved seen plays piano."
Can you make any sense out of this?
|
You return to the bench after cracking the last code, and you notice an envelope on the ground directly under it. You put down your envelope with the previous code and pick up the new one, anticipating another challenge.
Crack the Code #2
Digits are referred to as A-B-C-D in the clues. "A + B" is the sum of the first a... |
The park bench has been compromised as a safe location, so you decide to meet in the lobby of the nearest hotel. Again, the envelopes are traded securely, along with the money you are receiving for each code. This code comes with a note.
“This is the hardest code yet. No more programs to crack this one, at least not ea... |
You are a double-agent in the most important war of the 20th century, The
Falklands war. For years you have been playing the United Kingdom and Argentinian
governments against each other, taking bribes from both sides and it has caught
up with you.
One day travelling you are snatched off the street, kidnapped, drugged ... |
You are on a quest to the find the lost kingdom of Acarien. On your way, you end up at a fork in the road. Both paths look exactly the same. At the junction sits a wise man. The wise man will only speak the words “ça” or “ɠa” meaning either yes or no (you don’t know which means which). The wise man will answer any yes-... |
The government has introduced a standardised test to identify dumb people and make them ineligible to apply for any government jobs, a pass in the exam is mandatory for applications in future.
It was hard to come up with a test that can provide 100% accuracy, however the creators of the test argued that 289 of every ... |
Once again, you're on your way to Acarien. You find yourself in a land of Knights and Knaves, who understand your language but don't speak it. You understand nor speak their language, but you do know their words for yes and no, "yok" and "pom". Unfortunately, you don't know which is which. And of course, as always, Kni... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.