instruction stringlengths 15 30k |
|---|
There are 3 talking hats on the table. Each can ask 2 questions, to either hat. 1 of them speaks only truth. 1 speaks only lies. 1 can speak only when spoken to, he will speak at random.
YOU know who's who just fine. But you cannot tell the hats. You can only tell a hat a question to ask one of the other hats, you c... |
There are 3 talking hats on the table. Each can ask 2 questions, to either hat. 1 of them speaks only truth. 1 speaks only lies. 1 can speak only when spoken to, he will speak at random.
YOU know who's who just fine. But you cannot tell the hats. You can only tell a hat a question to ask one of the other hats, you c... |
I state that in the current formulation this is impossible.
Let's take for example the truth-hat, it will ask questions. Other hats we number as 1 and 2.
Now consider both possible situations:
A) 1 is lie-hat, 2 is random-hat.
B) 2 is lie-hat, 1 is random-hat.
Using those question truth-hat must find o... |
There are 3 talking hats on the table. Each can ask 2 questions, to either hat. 1 of them speaks only truth. 1 speaks only lies. 1 can speak only when spoken to, he will speak at random.
YOU know who's who just fine. But you cannot tell the hats. You can only tell a hat a question to ask one of the other hats, you c... |
There are 3 talking hats on the table. Each can ask 2 questions, to either hat. 1 of them speaks only truth. 1 speaks only lies. 1 can speak only when spoken to, he will speak at random.
YOU know who's who just fine. But you cannot tell the hats. You can only tell a hat a question to ask one of the other hats, you c... |
The Truth-Teller asks Hat-A "Is he a Truth-Teller". If he answers then he the Random-Hat. If he doesn't then he is the Liar. Hat-B can now be inferred. Only one question needed.
The Liar asks Hat-A "Will Random-Hat say 'yes' to his next question?". If he answers then he the Random-Hat. If he doesn't then he is the T... |
Brian wrote...
Hi, my name is Brian. I love to play video games, and write stories. Nobody is better than me at it! The only problem is I'm running out of story ideas. Can you help me? Pitch some ideas! Thanks
Then posted it on a billboard. A week later he got a call saying something was wrong with his note. Bria... |
What's the problem in the following paragraph? |
Cut the piece of paper in a perfect half, weigh each half, it's a now perfectly balanced equation!
+1 for originality? |
Runs to the nearest store, buys a scale.
Cut the piece of paper in a perfect half, weigh each half, it's a now perfectly balanced equation!
+1 for originality? |
"Are you about to say neither no nor yes?"
Truth: ...
He cannot speak without lieing.
Lie: ...
He cannot speak without lieing
Random: Yes/No
Speaks freely as he has no restrictions since he speaks randomly.
So in other words, if he's silent, bingo! |
Actually here is an excellent puzzle with all 3 characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to fi... |
Can I ask you 2 questions?
Truth: ...
Don't know, can only say yes/no
Lies: ...
Don't know, can only say yes/no
Random: Yes/No
?? |
Actually here is an excellent puzzle with all 3 characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to fi... |
Actually here is an excellent puzzle with all 3 characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to fi... |
I think I got it this time! If you need any clarifications comment!
Take 2 and seperate them. Ask them 1 of them (<- key word!) "Can I trust the other?"
They'll talk together and the response will be "No" if the seperated one is random, because truth will say "no" because he assumes you mean the liar and is hones... |
Actually here is an excellent puzzle with all 3 characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to fi... |
I think I got it this time! If you need any clarifications comment!
Take 2 and seperate them. Ask them 1 of them (<- key word!) "Can I trust the other?"
They'll talk together and the response will be "No" if the seperated one is random, because truth will say "no" because he assumes you mean the liar, and is hone... |
Actually here is an excellent puzzle with all 3 characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to fi... |
Actually here is an excellent puzzle with all 3 characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to fi... |
I don't think that anyone has put a lot of effort in developing such a method.
The problem on such a method is, that it would be require a lot of searching for pieces, the algorithms are hard to recognize and so on. At least nobody have proven otherwise.
I'm into speedsolving (solving the cube as fast as possible... |
I think I got it this time! If you need any clarifications comment!
Take 2 and seperate them. Ask them 1 of them (<- key word!) "Can I trust the other?"
They'll talk together and the response will be "No" if the seperated one is random, because truth will say "no" because he assumes you mean the liar, and is hone... |
> #Names in Boxes
> - The names of 100 prisoners are placed in 100 wooden boxes, one name to a box, and the boxes are lined up on a table in a room.
> - One by one, the prisoners are led into the room; each may look in at most 50 boxes, but must leave the room exactly as he found it
> and is permitted... |
War has broken out in the kingdom. The king's castle is guarded pretty heavily, by guards with instructions to kill anyone who can't produce the correct password.
Unbeknownst to the guards, the beggar near the main gate is in fact an enemy spy. He listens intently as the first knight approaches. "Six!", the guard ca... |
What's the password? |
Actually here is an excellent puzzle with all 3 characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to fi... |
Actually this IS doable. As quite a few other answers have argued, it's clear from common sense that no question you ask somebody rule out the person you ask being the Joker. No matter what you ask, you always have to worry about the Joker screwing up your logic.
But, the aim is to identify one person who is NOT the... |
Some years back I was travelling by a cargo ship from New Zealand to Tahiti. I was curious to look around the ship one day and in the boiler room I asked a man how old the ship was. He smiled and replied me in this way: 'The ship is twice as old as its boiler was when the ship was as old as the boiler is now. And the c... |
You know, that puzzle where 1 slot is open and you slide around to make a picture? What's the maximum amount of moves required to complete it, if you got the worst position possible? |
What's the maximum required amount of moves to solve the 15 puzzle? |
An engineer has invented a robotic vacuum cleaner to sweep the floor of his house. The floor plan, shown below, is made up of many square tiles, with walls at certain places, represented by black cells.
![enter image description here][1]
The robot cleans one tile at a time, then moves either N, E, S, or W to the ... |
A soldier of the International Army received a message which shows 2 pictures of a finished chess game (shown below) with the text; **The White Army stood still, while the Black Army dashed**. What is the message contain within this 2 images?
![first board][1]
![second board][2]
[1]: https://i.stack.imgu... |
The obvious place to look for words from a chess board is algebraic chess notation, but after looking at a cheat sheet for a few minutes, it doesn't seem like there's any clear way to assemble a message from that.
So, well, it's a military scenario, and we have the word "dashed" in the message, maybe morse code? In ... |
There are 3 talking hats on the table. Each can ask 2 questions, to either hat. 1 of them speaks only truth. 1 speaks only lies. 1 can speak only when spoken to, he will speak at random.
YOU know who's who just fine. But you cannot tell the hats. You can only tell a hat a question to ask one of the other hats, you c... |
Sometimes a clock is posted on Facebook and the likes where digits are substituted by mathematical expressions. A friend of mine asked me what is the smallest numbers of "nine" which let one express numbers from 1 to 12, using the four basic operations, square root, factorial, decimal point and the notation .(9) = 1.
... |
There are 2 twins who think the same, look the same, and act the same. The only difference is that 1 of them is male, 1 is female. Without asking the twin for their gender, how can you figure this out? You have a minimum of 2 questions. |
Sometimes a clock is posted on Facebook and the likes where digits are substituted by mathematical expressions. A friend of mine asked me what is the smallest numbers of "nine" which let one express numbers from 1 to 12, using the four basic operations, square root, factorial, decimal point and the notation .(9) = 1.
... |
How many numbers can you represent using only *one* 9?
* $9$ itself
* The four basic operations require at least two numbers, so they're out
* $\sqrt 9 = 3$
* $9! = 362880$ and $\sqrt 9! = 6$ and $\sqrt{9!} = 602.395...$
* Decimal point requires at least two numbers
* $.{\bar 9} = 1$ and $\sqrt{.{\bar 9}} = 1$ ... |
Ask one: do you have a brother? If answer is "yes", so this twin is female, otherwise this twin is male.
Another question doesn't matter (any you want). |
There are 2 twins who think the same, look the same, sound the same, and act the same. The only difference is that 1 of them is male, 1 is female. Without asking the twin for their gender, how can you figure this out? You have a minimum of 2 questions. |
There are 2 twins who think the same, look the same, sound the same, and act the same. The only difference is that 1 of them is male, 1 is female. Without asking the twin for their gender, how can you figure this out? You have a maximum of 2 questions. |
Ask one: do you have a brother? If answer is "yes", so this twin is female, otherwise this twin is male.
|
Ask one: "Do you have a twin brother?" If answer is "yes", so this twin is female, otherwise this twin is male.
Another question doesn't matter (any you want). |
Ask one: "Do you have a twin brother?" If answer is "yes", so this twin is female, otherwise this twin is male.
|
There are already correct answers, but they are quite bulky. Hire is the most simplest and beautiful answer I know:
>! You should ask the 1-st "Does 2-nd lies more often than 3-rd?". If "yes" - chose 2-nd, if "no" - chose 3-rd.
The prove:
>! If 1-st is Joker you succeed immediately. If 1-st is Knight, then 2-... |
There are already correct answers, but they are quite bulky. Hire is the most simplest and beautiful answer I know:
>! You should ask the 1-st "**Does 2-nd lies more often than 3-rd?**". If "yes" - chose 2-nd, if "no" - chose 3-rd.
>! If 1-st is Joker you succeed immediately. If 1-st is Knight, then you chose th... |
Two boys , Brian and Gabe, decide to play a game.
They lay 20 coins on the table. Each player took turns taking 1, 2, or 3 coins. Whoever took the last coin won.
Brian thought if he went first, he'd win for sure since he had the advantage of making the first move. So Brian did go first. But Gabe won every time!
... |
Assume square A1 is black, and that the floor is covered in a checkerboard pattern. Then, the entire grid contains 253 squares, 127 black and 126 white.
Since the tiles alternate colour whenever the robot moves to a new tile, any path that ends up back on itself must be of even length. But there are an odd number o... |
If I asked your twin which gender you are, what would they tell me?
Even if they're both liars you'll get the right answer. |
There are already correct answers, but they are quite bulky. Hire is the most simplest and beautiful answer I know:
>! You should ask 1-st "**Does 2-nd lies more often than 3-rd?**". If "yes" - chose 2-nd, if "no" - chose 3-rd.
>! If 1-st is Joker you succeed immediately. If 1-st is Knight, then you'd chose the ... |
There are already correct answers, but they are quite bulky. Hire is the most simplest and beautiful answer I know:
>! You should ask 1-st "**Does 2-nd lie more often than 3-rd?**". If "yes" - chose 2-nd, if "no" - chose 3-rd.
>! If 1-st is Joker you succeed immediately. If 1-st is Knight, then you'd chose the b... |
My friend suggested another interesting idea to answer this question.
Contradict himself means to say something illogical, independently of the perception of the reality. For example, "sky is not blue" would not be contradiction, may be our Knave is colorblind, or just crazy. But must leave here a criteria for what ... |
John and Jane are playing a game. They both go too the bank and get 1000 euros in 2 euros. So each of them has 500 euros at stake. They then find a large rectangle table and decide who wins the following game gets to keep all of the coins currently at the table. The rules are as follows:
- It is a turn-based game, ... |
Let's call the people: A, B and C.
Ask the following question to A:
> "If I would ask you if C is a joker, would you certainly say yes?"
If A says yes, B is not a joker. If A says no, C is not a joker.
This is why: If A is a truthteller or a liar, this kind of double-question reliably identifies the joker.... |
So lets see how much information can be exchanged, my highest is **m = 108**.
Lets look at the restraints.
1) The number of stones is the only information that may be collected.
2) The two spies must take turns , they must therefore take the same number of turns
3) The number of stones is limited , 26
... |
John and Jane are playing a game. They both go too the bank and get 1000 euros in 2 euros. So each of them has 500 euros at stake. They then find a large rectangle table and decide who wins the following game gets to keep all of the coins currently at the table. The rules are as follows:
- It is a turn-based game, ... |
"Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo"
The sentence above is an actual sentence which makes perfect sense and is not wrong.
The word "Buffalo" as three meanings:
1) The City of Buffalo, New York
2) To buffalo (verb) to bully/intimidate
3) The animal Buffalo/bison
Can y... |
"Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo"
The sentence above is an actual sentence which makes perfect sense and is not wrong.
The word "Buffalo" as three meanings:
1) The City of Buffalo, New York
2) To buffalo (verb) to bully/intimidate
3) The animal Buffalo/bison
Can y... |
I might have to disagree with the above answer being the only solution. What would prevent the numbers from being 11 and 12? You cannot prove that 4 is the number based on the information as 11 and 12, or even 13 and 12 would answer the questions the same way. In fact i would say any numbers in the form of **X modu... |
Let's call the people: A, B and C. Ask the following question to A:
> "Is B a knave or C a knight?"
If A says yes, B is not a joker. If A says no, C is not a joker. |
What is twice the answer to this question ?
Just thought some people here would like this brain-teaser ;) |
What is twice the answer to this question? |
It is not a number, isn't it ? |
It is [NaN (not a number)](http://jsfiddle.net/66yhg6cm), isn't it? |
Let's call the people: A, B and C. Ask the following question to A:
> "Is B a knave or C a knight?"
If A says yes, B is not a joker. If A says no, C is not a joker.
If A is a knight and says yes, we have A=knight, B=knave, C=joker.
If A is a knave and says yes, we have A=knave , B=knight, C=joker.
If A... |
What is the next 3 numbers? |
Here is a puzzle with 3 characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to find at least one person who... |
Here is an excellent puzzle with 3 types of characters:
> You are lost in a town and meet 3 men. You somehow (God told you) know that they are Knight, Knave and Joker. Knight always tells truth, Knave always tells the opposite to the truth, Joker randomly decides whether to tell truth or lie.
You need to find at ... |
Assume square A1 is black, and that the floor is covered in a checkerboard pattern. Then, the entire grid contains 253 squares, 127 black and 126 white. A total of 42 squares are removed, leaving 211 squares.
Since the tiles alternate colour whenever the robot moves to a new tile, any path that ends up back on itse... |
So lets see how much information can be exchanged, my highest is **m = 715** or 1430 for both spies.
Lets look at the restraints.
1) The number of stones is the only information that may be collected.
2) The two spies must take turns , they must therefore take the same number of turns
3) The number of st... |
The question can be rephrased as "What is "the answer to this question" written twice in a row?"
This would be "the answer to this question the answer to this question". |
My algorithm is more likely to work more quickly than those listed. However since the button is random no algorithm is 100% sure to solve the puzzle.
Is the number of Doors on a side odd?
if yes Push A;
Is there a single gap between the two doors on a side?
if yes Push C and Win.
Otherwise Push ... |
After about an hour and a half, this is what I came up with;
1, 1, 2, 3, 11, 44, 129, 557, 2354, 7059, 11961, 19233, 66058
I used a difference table to figure it out:
1, 1, 2, 3, 11, 44, 129, 557, 2354, 7059, ?, ?, ?
0, 1, 1, 8, 33, 85, 428, 1797, ?, ?, ?
1, 0, 7, 25, 52, 375, 1369, ?, ?, ?
-1, 7, 1... |
This is one of my favorite puzzles from a popular game series. I'm going to slightly rewrite it to hamper Google-fu.
A woman wanted to visit her bestie at the hospital. She walked 500 meters from her front door before remembering that she wanted to pick up some flowers. She went back to the florist, got the flowers... |
Well, the florist is in between so, since it's 800 meters away, I'd say that the total distance from house and hospital is 1600 meters. So the florist is about 800 meters from her house. So that don't really alter her path, so she walked 1600 + 1600 meters, 2800 meters. Give or take a few for walking in the florist, an... |
There are some questions that marked off-topic or down-voted. I think there must be a place for whom try to create attractive or challenging puzzles in puzzling. So this topic came up.
****
**Question from experienced people in puzzle creation:**
Please post a brief explanation about
- *What are your expe... |
How to create a fun puzzle? |
There are some questions that marked off-topic or down-voted. I think there must be a place for whom try to create attractive or challenging puzzles in puzzling. So this topic came up.
****
**Question from experienced people in puzzle creation:**
Please post a brief explanation about
- *What are your expe... |
You are a treasure hunter in search of the legendary gold of the Isle of Goon. According to your research the gold is buried either behind the old church, or under the giant palm tree. You travel to Goon with the intention of asking about the gold. Inhabitants of this island are not known for their truthfulness, so you... |
About 20 years ago on a forum now long gone, someone posted the above question. After people had a chance to try it, he also posted the answer. I no longer remember the answer but really wish I did.
The answer was not along the lines of "I want that, that, that, that, that, that, and that."
Anyone have any ideas? |
A grammatically valid sentence in English containing seven "that" in a row? |
Short answer: Gold is behind church
A's sentence illustrate that one of them tells truth and the other lies. why?
> if A=truth => B=lie
> if A=lie => B=truth
Hence,
> if A=truth => B=lie ... B's condition is true and is saying that gold is not behind church. B is a liar, So gold is behind church
> if... |
You awake in the middle of a maze. You do not know how large the maze is. You do not know how many paths there are.
How can you assure you get in the shortest ammount of time?
This assumes the following things:
*There is only 1 exit
*You do not know the correct path
*You cannot walk through walls
*You... |
Can you prove in two different ways that at this moment, some two persons on Earth have exactly the same number of hairs on the head ? |
You have $99$ computers in a LAN room, and you know that at least $50$ are working. The others can be faulty.
The only thing you are allowed to do is to ask computer $i$ the question "Is computer $j$ working?" for any $i$ and $j$. If $i$ is working, it will tell the truth, otherwise if it is faulty, it can answer anyt... |
otherwise if it is faulty, it can answer anything.
You might have slightly mis-typed the question, but if you haven't, then you could use a SQL injection attack to get a different question in there, and abuse the fact that broken computers can answer anything.
Keep trying all the different computers, until yo... |
You have $99$ computers in a LAN room, and you know that at least $50$ are working. The others can be faulty.
The only thing you are allowed to do is to ask computer $i$ the question "Is computer $j$ working?" for any $i$ and $j$. If $i$ is working, it will tell the truth, otherwise if it is faulty, it can answer anyt... |
> How can you assure you get in the shortest amount of time?
Unfortunately, if you know nothing about the design of the maze, then there is no optimal strategy. For example, it would be easy to design a maze that quickly splits off into two paths - one that ends almost immediately, and one that winds around to use u... |
Short answer: Gold is behind church
A's sentence illustrate that one of them tells truth and the other lies. why?
> if A=truth => B=lie
> if A=lie => B=truth
Hence,
> if A=truth => B=lie ... B's condition is true and is saying that gold is not behind church. (because: the statement person A just made wa... |
There is one Lake, In that lake, every day some numbers of lotus flowers are take births(i mean they grows new),But it follows one pattern , that if at day 1 there are X numbers of flowers then on next day there will be 2X numbers of flowers will be there(Everyday flowers get doubled). Now the main question is
I... |
You awake in the middle of a maze. You do not know how large the maze is. You do not know how many paths there are.
How can you assure you get in the shortest amount of time?
This assumes the following things:
* There is only 1 exit
* You do not know the correct path
* You cannot walk through walls
* You ca... |
You awake in the middle of a maze. You do not know how large the maze is. You do not know how many paths there are.
How can you assure you get out in the shortest amount of time?
This assumes the following things:
* There is only 1 exit
* You do not know the correct path
* You cannot walk through walls
* Yo... |
There is a lake in which every day some new lotus flowers grow. Their growth follows a pattern; if on a given day there are X flowers, then on the next day there will be 2X flowers will be there. So everyday the number of flowers gets doubled.
Now the main question is:
If the whole lake gets covered with lotus f... |
A woman wanted to visit her friend at the hospital. She had walked 500 meters from her front door before remembering that she wanted to pick up some flowers. She went back to the florist she had walked past, bought some flowers, and continuned to the hospital. It was another 800 meters to the hospital. After visiting, ... |
John and Jane are playing a game. They both go to the bank and get 1000 euros in 2 euros. So each of them has 500 euros at stake. They then find a large rectangle table and decide who wins the following game gets to keep all of the coins currently at the table. The rules are as follows:
- It is a turn-based game, s... |
Here's a puzzle I heard some time ago, but I never heard the askers solution. It took me ages to think up a satisfactory solution, but i'm wondering if there are any others you can think of?
100 Marbles Puzzle:
A boy has two bags with marbles in. He has exactly twice as many marbles in one bag as in the other bag... |
...leaving behind three sons, 17 camels and the following order:
* His oldest son shall inherit one in two camels.
* His middle son shall inherit one in three camels.
* His youngest son shall inherit one in nine camels.
Now the three don't know what to do. So they ask an old friend of the family, which knows a ... |
There is a painting tool that can paint a circle area of $1$ radius. What is the shortest painting track for painting a $100*100$ rectangle on wall? How much did the painting tool moved in total?
*****
Rules:
- Tool must touch wall only *once*.
- Painting can start from and finish anywhere. |
There is a painting tool that can paint a circle area of $1$ radius. What is the shortest painting track for painting at least a $100*100$ rectangle on wall? How much did the painting tool moved in total?
*****
Rules:
- Tool must touch wall only *once*.
- Painting can start from and finish anywhere.
- painti... |
your partners space ship has crashed... only the radio transmitter and his compass were still operation... he asked you to rescue him...
he tells you how to find him by that following story:
1. he went one unit into the south
2. then he went one unit to the west
3. then he went one unit to the north
4. afte... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.