instruction stringlengths 15 30k |
|---|
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=1..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... |
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 nam... |
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.
Wh... |
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][1] 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 ... |
In regular chess no piece can checkmate the opposite king alone (i.e. without the help of his allied king). But a [Maharajah][1] 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 ... |
In regular chess no piece can checkmate the opposite king alone (i.e. without the help of his allied king). But a [Maharajah][1] 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 ... |
In regular chess no piece can checkmate the opposite king alone (i.e. without the help of his allied king). But a [Maharajah][1] 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 ... |
In regular chess no piece can checkmate the opposite king alone (i.e. without the help of his allied king). But a [Maharajah][1] 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 ... |
So far nobody has given an optimal answer.
Here is what I believe is the optimal answer for 6 stacks. It can sort 8 numbers.
The rule is simple to follow: move each card to the next stack, unless the number is forbidden for that stack in which case you put it on the following one. When all the cards are on stac... |
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.
Hint... |
In regular chess no piece can checkmate the opposite king alone (i.e. without the help of his allied king). But a [Maharajah][1] 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 ... |
So far nobody has given an optimal answer.
Here is what I believe is the optimal answer for 6 stacks. It can sort 8 numbers.
The rule is simple to follow: move each card to the next stack, unless the number is forbidden for that stack in which case you put it on the following one. When all the cards are on stac... |
Does anyone knows the name of the puzzle showed in the image below?
![Starting position][1]
[1]: https://i.stack.imgur.com/ezuq0.jpg
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 th... |
What's the name of this puzzle, which consists of small cubes connected by elastics? |
## With $M$ stacks we can sort $F_M$ numbers
<sup>(where $F_M$ is the $M$-th [Fibonacci Number](http://en.wikipedia.org/wiki/Fibonacci_number))</sup>
This is an answer for the call for generalization in [OP's answer](http://puzzling.stackexchange.com/a/3031/1649), by generalizing his/her method.
For comparison... |
## With $M$ stacks we can sort $F_M$ numbers
<sup>(where $F_M$ is the $M$-th [Fibonacci Number](http://en.wikipedia.org/wiki/Fibonacci_number))</sup>
This is an answer for the call for generalization in [OP's answer](http://puzzling.stackexchange.com/a/3031/1649), by generalizing his/her method.
For comparison... |
## With $M$ stacks we can sort $F_M$ numbers
<sup>(where $F_M$ is the $M$-th [Fibonacci Number](http://en.wikipedia.org/wiki/Fibonacci_number))</sup>
This is an answer for the call for generalization in [OP's answer](http://puzzling.stackexchange.com/a/3031/1649), by generalizing his/her method.
For comparison... |
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 a... |
Do you choose the other door? |
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.
Hint... |
## With $M$ stacks we can sort $F_M$ numbers
<sup>(where $F_M$ is the $M$-th [Fibonacci Number](http://en.wikipedia.org/wiki/Fibonacci_number))</sup>
This is an answer for the call for generalization in [OP's answer](http://puzzling.stackexchange.com/a/3031/1649), by generalizing his/her method.
For comparison... |
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 "Ye... |
Is there probability based Knight-Knave puzzles? |
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 "Ye... |
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.
Hint... |
The [Numberplay][1] 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.
1. You can change a single letter in place, as in traditional word ladders — for examp... |
Not that I know of... But it'd be easy to come up with that kind of thing.
"You arrive at an island one night where you find 2 types of people, intelligent, and people who often think randomly. You go up to one and ask them if you're thinking of a number between 1 and 3. How can you tell who's who after they tell ... |
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 wr... |
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 a Knight, a Knave and Joker. They all look alike, and they can only answer "yes"/"no". (no paradoxes allowed!).
What is the fewest questions you can ask to find t... |
Drink 1 was only poison. Drinks 2+ also contained the antidote. Who's the better (repeat) customer? |
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 a Knight, a Knave and a Joker. They all look alike, and they can only answer "yes"/"no". (no paradoxes allowed!).
What is the fewest questions ... |
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. They all look alike, and they can only answer "yes"/"no". (no paradoxes allowed!).
What is the few... |
First, you find a nonjoker in a single question as in http://puzzling.stackexchange.com/questions/2484/knight-knave-and-joker-puzzle
Then you ask the nonjoker questions of the form "If I were to ask the other nonjoker X, what would he reply?" This is the way around not knowing whether you are asking Knight or Knave ... |
First, you find a nonjoker in a single question as in http://puzzling.stackexchange.com/questions/2484/knight-knave-and-joker-puzzle
Then you ask the nonjoker questions of the form "If I were to ask the other nonjoker X, what would he reply?" This is the way around not knowing whether you are asking Knight or Knave ... |
**6 questions are enough**
In one question you exclude the joker. If the people are A, B, C, ask to A:
> "Is B a knave or C a knight".
If A says yes, continue with B. If A says no, continue with C.
With the selected person you can find the correct door with a binary search by asking:
> "If I'd ask you wh... |
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. |
If I am allowed to ask about individual digits, I can do it in 6.
First question: Where X is the number from 1 to 100 inclusive, if X - 1 is left padded with zeros (00-99), is the left digit 5?
If the answer is "lower", I ask about 2. If higher I ask about 7 or 8.
Say I asked about 2, and the answer again c... |
If I am allowed to ask about individual digits, I can do it in 6.
First question: Where X is the number from 1 to 100 inclusive, if X - 1 is left padded with zeros (00-99), is the left digit 5?
If the answer is "lower", I ask about 2. If higher I ask about 7 or 8.
Say I asked about 2, and the answer again c... |
Yes.
Each guess eliminates one number as well as dividing the remaining numbers into 2. One guess can pick a number from 3 (is your number 2?). 2 guesses can do 7. N guesses can pick a number from $2^{N+1}-1$, so 6 guesses can do it for 1-127. |
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 requi... |
As I've said in many other questions, puzzles like the one you posted are what I call *information puzzles* – that is, puzzles where you perform some trial to get as much information as possible about a certain unknown fact.
In this case, you can notice that each slave you use can either die or not die, which ... |
Yes.
Each guess eliminates one number as well as dividing the remaining numbers into 2. One guess can pick a number from 3 (is your number 2?). 2 guesses can do 7. N guesses can pick a number from $2^{N+1}-1$, so 6 guesses can do it for 1-127.
Edit: As noted in the comments, you're supposed to have **guessed** th... |
Nobody _quite_ has the right answer to why this is impossible in less than seven questions (assuming you're restricted to asking about single numbers).
Here is why. Whatever number you pick first, there is some chance that the answer will be on the "big" side; the smallest you can make the big side is 50. (E.g. if... |
Nobody _quite_ has the right answer to why this is impossible in less than seven questions (assuming you're restricted to asking about single numbers).
Here is why. Whatever number you pick first, there is some chance that the answer will be on the "big" side; the smallest you can make the big side is 50. (E.g. if... |
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... |
Following these questions: http://puzzling.stackexchange.com/questions/2588/faulty-computers/2774#2774, http://puzzling.stackexchange.com/questions/593/knights-and-jokers I wonder, what if the conditions are the following:
> 1. We have T Knights (truth-tellers), L Knaves (liars) and R Jokers (random-tellers). $T > ... |
Following these questions: http://puzzling.stackexchange.com/questions/2588/faulty-computers/2774#2774, http://puzzling.stackexchange.com/questions/593/knights-and-jokers I wonder, what if the conditions are the following:
> 1. We have T Knights (truth-tellers), L Knaves (liars) and R Jokers (random-tellers). $T > ... |
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... |
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, ... |
Totally ripping off [Matt Malone][1]'s answer:
[1]: http://puzzling.stackexchange.com/users/2162/matt-malone
If you can ask any question about the number where "correct," "too high," or "too low" are valid answers, go with:
1. If you translate the number into trinary, is the last digit a "1"?
2. If you tr... |
Why vertically? It's difficult, but if you can somehow bury yourself in a shallow grave then you may be able to get back up when the mob boss has moved away to avoid getting his shoes wet. |
Ask all three "Do I have a ball?" while holding up a ball. If the first two agree, let the third leave.
If the dissenter said yes, he is a knight. If he said no he is a knave. The other two are obviously the other two.
Tell them they may leave when they disagree.
Repeatedly ask them in random order differen... |
Let's assume the jokers are intelligent, coordinated and aware of our strategy. If they fail to meet these conditions they only make it easy for us.
**Edited for clarity**
This works for any $R<T+L$, so long as T>0 (because there must be a knight to identify).
Step one is to identify the knave(s) by the fact t... |
Let's assume the jokers are intelligent, coordinated and aware of our strategy. If they fail to meet these conditions they only make it easy for us.
**Edited for clarity**
This works for any $R<T+L$, so long as T>0 (because there must be a knight to identify).
Step one is to identify the knave(s) by the fact t... |
Totally ripping off [Matt Malone][1]'s answer:
[1]: http://puzzling.stackexchange.com/users/2162/matt-malone
If you can ask any question about the number where "correct," "too high," or "too low" are valid answers, go with:
1. If you translate the number into trinary, is the last digit a "1"?
2. If you tr... |
Ask all three "Do I have a ball?" while holding up a ball. If the first two agree, let the third leave.
If the dissenter said yes, he is a knight. If he said no he is a knave. The other two are obviously the other two.
Ask the leaving knight or knave if each of the remaining two ever behaved differently from t... |
A very old man has a million dollars, which he's going to pass it down 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 alway... |
This isn't a complete answer, but I put it here to see if it can help in the generation of a complete answer.
Let us consider a necessary condition (though not a sufficient one) for a solution.
Lets say a bunny "diags" when it transitions to a diagonally adjacent square. This counts as a visit of the square onto ... |
Following these questions: http://puzzling.stackexchange.com/questions/2588/faulty-computers/2774#2774, http://puzzling.stackexchange.com/questions/593/knights-and-jokers I wonder, what if the conditions are the following:
> 1. We have T Knights (truth-tellers), L Knaves (liars) and R Jokers (random-tellers). $T > ... |
This isn't a complete answer, but I put it here to see if it can help in the generation of a complete answer.
Let us consider a necessary condition (though not a sufficient one) for a solution.
Lets say a bunny "diags" when it transitions to a diagonally adjacent square. This counts as a visit of the square onto ... |
I would like to try more strict conditions for [puzzle][1], which frodoskywalker solved so simply. Basically all the same, but only one type of questions is allowed.
> 1. 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.... |
I would like to try more strict conditions for [puzzle][1], which frodoskywalker solved so simply. Basically all the same, but only one type of questions is allowed.
> 1. 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.... |
This isn't a complete answer, but I put it here to see if it can help in the generation of a complete answer.
Let us consider a necessary condition (though not a sufficient one) for a solution.
Lets say a bunny "diags" when it transitions to a diagonally adjacent square. This counts as a visit of the square onto ... |
Let's assume the jokers are intelligent, coordinated and aware of our strategy. If they fail to meet these conditions they only make it easy for us.
**Edited for clarity**
This works for any $R<T+L$, so long as T>0 (because there must be a knight to identify).
Step one is to identify the knave(s) by the fact t... |
Inspired by http://puzzling.stackexchange.com/q/3074/68, 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 on... |
The answer to the question is in the question itself.
Let **Alice**, **Bob** and **Charles** represent each person respectively.
You have never met any of these teenagers or asked them any questions (otherwise, pick somebody who hasn't). However, they don't know that, as e*ach person only knows their individual h... |
For simplicity, I'm going to refer to the associates as knight, knave, and joker. Also, I'm assuming that they won't reveal the location of the money. If they did, then obviously you would switch to that once they reveal it.
Assuming that there is an equal chance of any of the three associates coming up and talking ... |
For simplicity, I'm going to refer to the associates as knight, knave, and joker. Also, I'm assuming that they won't reveal the location of the money. If they did, then obviously you would switch to that once they reveal it.
Assuming that there is an equal chance of any of the three associates coming up and talking ... |
Inspired by http://puzzling.stackexchange.com/q/3074/68, 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 on... |
Inspired by http://puzzling.stackexchange.com/q/3074/68, 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 on... |
Inspired by http://puzzling.stackexchange.com/q/3074/68, 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 on... |
For clarity, I label the switches and output slots as follows:
Switches are labeled from left to right, top to bottom as 1-7. Slots are labeled left to right as A-F.
If we keep dropping coins down slot 1, eventually a coin will come out slot A. At that point we know switch 1 is facing out without coin and switch ... |
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, ho... |
This is the problem I came across reading the book "The art and craft of problem solving". I read this question I couldn't able to figure out the solution and I saw the solution after a while, but still I couldn't able to understand the solution as well.
Question:
Pat wants to take a $1.5$-meter-long sword onto a... |
The 3 wise monkeys are having dinner.
On the next table sit 3 very attactive monkeys so every move is attentively watched. We will assume they have different wigs on that stay in place and are not particularly wise so we can distinguish the 6 monkeys.
The brunette monkey complains that her banana daquari is not... |
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, ... |
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 nam... |
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.
<sub>Digits are referred to as A-B-C-D in the clues. "A + B" is the sum of the first and seco... |
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 ... |
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.
<sub>Digits are referred to as A-B-C-D in the clues. "A + B" is the sum of the first and seco... |
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.
http://puzzling.stackexchange.com/questions/3154/crack-the-code... |
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.
http://puzzling.stackexchange.com/questions/3154/crack-the-code... |
A $1\text{m} \times 1\text{m} \times 1\text{m}$ box is a bit overkill. The diagonal is almost $20\text{cm}$ longer than needed!
So let's find a couple of smaller solutions.
### Minimal height ###
Let's say we have a box with a base of $1\text{m} \times 1\text{m}$. What is the minimal height $h$ do we need?
Th... |
Can I do something like this?
![enter image description here][1]
[1]: https://i.stack.imgur.com/ldcTA.png
*Please do not down vote XD |
A $1\text{m} \times 1\text{m} \times 1\text{m}$ box is a bit overkill. The diagonal is almost $20\text{cm}$ longer than needed!
So let's find a couple of smaller solutions.
### Minimal height ###
Let's say we have a box with a base of $1\text{m} \times 1\text{m}$. What is the minimal height $h$ we need?
The l... |
I would like to try more strict conditions for [puzzle][1], which frodoskywalker solved so simply. Basically all the same, but only one type of questions is allowed.
> 1. 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.... |
This is the problem I came across reading the book _[The Art and Craft of Problem Solving][amazon]_. 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... |
## Explanation ##
The solution given hinges on the fact that, while the sword itself is longer than the maximum allowed length, we can construct a volume in which the sword fits, that doesn't exceed the restrictions. Contradictory, we can work around the restrictions that were undoubtedly enforced to save space, by ... |
I was having a party at my new 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.
What's my house number? |
The fact that the first child among two is a boy has no effect on the sex of the second because the draw "sex of the first child" and "sex of the second child" are independant.
The probability of the other sibling being a girl is equal to the probability for any child picked at random to be a girl.
The chance is ... |
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.
http://puzzling.stackexchange.com/questions/3154/crack-the-code... |
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 nam... |
I was having a party at my new 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 guess di... |
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 o... |
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 o... |
A friend of mine made a simple bar bet, in which he wrote down a list of ten words, but covered up the first two with his hand. The words underneath 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 first ... |
A friend of mine made a simple bar bet, in which he wrote down a list of ten words, but covered up the first two with his hand. The 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 first words... |
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? |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.