instruction stringlengths 15 30k |
|---|
You are given a 15x15 grid and asked to cover it with rectangles who sides are a power of 2. For example you can use rectangles 8x1 and 4x4, but not 2x3. The rectangles must cover every cell of the grid, cannot overlap or be outside the grid. What is the least number of rectangles needed to achieve this covering? Good ... |
I once got a letter from my younger sister. It reads :-
> Hello brother,
>
> How are you? I am fine. I have seen you have given me a lot of gifts, thank you for that. Here's a present from my side. Since I like puzzles, I am giving you 3 notes with the letter as well. Do check it if you want. Happy Puzzling, hope ... |
You are given a 15x15 grid and asked to cover it with rectangles who dimensions are a power of 2. For example you can use rectangles 8x1 and 4x4, but not 2x3. The rectangles must cover every cell of the grid, cannot overlap or be outside the grid. What is the least number of rectangles needed to achieve this covering? ... |
You are given a 15x15 grid and asked to cover it with rectangles whose dimensions are a power of 2. For example you can use rectangles 8x1 and 4x4, but not 2x3. The rectangles must cover every cell of the grid, cannot overlap or be outside the grid. What is the least number of rectangles needed to achieve this covering... |
Well... Just using my knowledge of binary... I think the answer is:
>! **16**
Because:
>! Wouldn't 15 be only able to be made up of 8 + 4 + 2 + 1?
>! And to fit these in, this needs to be in both directions... which makes kind of tartan layers.
>!
>! [![enter image description here][1]][1]
[1]: ... |
Specific values:
* >! Putting $x=1$ gives $yf(1)\geq0$ for all $y\in\mathbb{R}$, so we must have $f(1)=0$.
* >! Putting $x=0$ gives $f(y)\geq (1-y)f(0)$ for all $y\in\mathbb{R}$, so $f$ is bounded below on any finite subset of $\mathbb{R}$.
Properties of the function $f$:
>! $yf(x)+f(y)\geq f(xy)$ implies tha... |
>
>
>A proverb and a myth, I will tell you a tale of two teams.<br />
I saw them last night in my dreams.<br />
The one team was sleeker, but started much weaker,<br />
The other was strong from the start.<br /><br />
Yes, the other was strong from the start.<br />
But we found that they had less heart.<br />
They gr... |
Consider the following functional equation: $$f(f(x))=x^2+x-7\quad\quad\forall\; x\in\mathbb{R}.$$ Does there exist a function $f:\mathbb{R}\to\mathbb{R}$ satisfying this, or not? |
The two teams might be:
>!Sperm cells and eggs
Because:
>! Sperm are sleeker and (maybe?) weaker than eggs, and "They grew and grew by one and two, And then they came apart" sounds like cell division.
However:
>! I cannot think of a proverb and myth about this. As for "You’ve worked with them hand in han... |
>
>
>A proverb and a myth, I will tell you a tale of two teams.<br />
I saw them last night in my dreams.<br />
The one team was sleeker, but started much weaker,<br />
The other was strong from the start.<br /><br />
Yes, the other was strong from the start.<br />
But we found that they had less heart.<br />
... |
I tried to write a program to solve a Skyscrapers puzzle. Currently im teaching it to find the next steps out of nopes(values which cannot be present on the field) values and clues.
So far the field looks like this:
0 3 0 5 3 4
= = = = = =
0 | | |6| | | | 0
= = = = = =
... |
I tried to write a program to solve a Skyscrapers puzzle. Currently I'm teaching it to find the next steps out of nopes (values which cannot be present on the field) values and clues.
So far the field looks like this:
0 3 0 5 3 4
= = = = = =
0 | | |6| | | | 0
= = = = = =
... |
I tried to write a program to solve a Skyscrapers puzzle. Currently I'm teaching it to find the next steps out of nopes (values which cannot be present on the field) values and clues.
So far the field looks like this:
3 5 3 4
= = = = = =
| | |6| | | |
= = = = = =
... |
I tried to write a program to solve a Skyscrapers puzzle. Currently I'm teaching it to find the next steps out of nopes (values which cannot be present on the field) values and clues.
So far the field looks like this:
3 5 3 4
= = = = = =
| | |6| | | |
= = = = = =
... |
You are given a 15x15 grid and asked to cover it with rectangles whose dimensions are a power of 2. For example you can use rectangles 8x1 and 4x4, but not 2x3. The rectangles must cover every cell of the grid, cannot overlap or be outside the grid. What is the least number of rectangles needed to achieve this covering... |
>My prefix is a doctor.
>
>My suffix isn't feeling well.
>
>My infix is myself.
>
>From earth to enamel, what am I?
----------------------
_As usual, please supplement final answers with explanations for each line. This '[Riley Riddle](https://puzzling.stackexchange.com/questions/62349/my-prefix-is-food-my-... |
This may be a question for a Maths forum, but was wondering if anyone has ever seen something that may guide me to a solution.
I am writing a Puzzling Site at the moment, which will naturally include Sudoku, and it struck me that there will be potential users that will try to cheat when solving puzzles (present comp... |
Checking for cheating in a Sudoku puzzle? |
This may be a question for a Maths forum, but was wondering if anyone has ever seen something that may guide me to a solution.
I am writing a Puzzling Site at the moment, which will naturally include Sudoku, and it struck me that there will be potential users that will try to cheat when solving puzzles (present comp... |
This may be a question for a Maths forum, but was wondering if anyone has ever seen something that may guide me to a solution.
I am writing a Puzzling Site at the moment, which will naturally include Sudoku, and it struck me that there will be potential users that will try to cheat when solving puzzles, and by cheat... |
You initially have 100 of each digit from 0 to 9. This means you have 1000 digits
in total. This count for each digit is shown in the table below.
| Digit | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|:-----------:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|
| # Remaining |... |
<sub>[The challenge idea][1], and images are credited to [Andrew][2]. </sub>
---
You initially have 100 of each digit from 0 to 9. This means you have 1000 digits in total. This count for each digit is shown in the table below.
| Digit | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|:----... |
<sub>*This is in the spirit of the What is a [Word™](https://puzzling.stackexchange.com/search?q=%22I+call+it%22+title%3A%22what+is%22+title%3Aword+is%3Aquestion)/[Phrase™](https://puzzling.stackexchange.com/search?q=%22I+call+it%22+title%3A%22what+is%22+title%3Aphrase+is%3Aquestion) series started by [JLee](https://pu... |
I hold the brightest of bright in a place with low light AND I am a place with low light that is not the night.
What am I? |
Are you
>! A theater/movie screen?
Brightest of bright in a place with low light
>! the movie screen is certainly the brightest thing in a low lit theater
I am a place with low light that is not the night.
>! a theater lowers the light, and while it may happen at night, it's not because of the night |
I hold the brightest of bright in a place with low light AND I am a place with low light that is not the night.
What am I?
Edit: The site wouldn't let me post the original version because it is not gramtically correct. I think it's better.
"Both brightest of bright and place with low light; what am I?" |
Here is a band-themed cryptic crossword, but instead of the answers being themed, the clues are! Each clue contains the name of (at least) one band, and while this resulted in some... wilder clues (and a lot of redundant "the"s), hopefully they're still decently fair (even counting the not-quite-properly checked corner... |
<sub>[The challenge idea][1], and images are credited to [HelloWorld1337][2]. </sub>
---
You initially have X of each digit from 0 to 9. This means you have X * 10 digits in total. This count for each digit is shown in the table below.
| Digit | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |... |
Let $T(n) = 1 + 2 + 3 + \text{...} + n$ be the $n$th triangular number.
For which $n>1$, if any, is it possible to split the first $\frac{n(n+1)}{2}$ positive integers into $n$ sets, all of different sizes, and each of them with elements adding to a perfect square?
What if the squares must all be different? |
<sub>[The challenge idea][1] is credited to [HelloWorld1337][2]. </sub>
---
You initially have X of each digit from 0 to 9. This means you have X * 10 digits in total. This count for each digit is shown in the table below.
| Digit | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|:---------... |
<sub>[The challenge idea][1] is credited to [HelloWorld1337][2]. </sub>
---
You initially have x of each digit from 0 to 9. This means you have x * 10 digits in total. This count for each digit is shown in the table below.
| Digit | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|:---------... |
Here is a band-themed cryptic crossword, but instead of the answers being themed, the clues are! Each clue contains the name of (at least) one band, and while this resulted in some... wilder clues (and a lot of redundant "the"s), hopefully they're still decently fair (even counting the not-quite-properly checked corner... |
Here is a band-themed cryptic crossword, but instead of the answers being themed, the clues are! Each clue contains the name of (at least) one band, and while this resulted in some... wilder clues (and a lot of redundant "the"s), hopefully they're still decently fair (even counting the not-quite-properly checked corner... |
You are given a 15x15 grid and asked to cover it with rectangles whose dimensions are a power of 2. For example you can use rectangles 8x1 and 4x4, but not 2x3. The rectangles must cover every cell of the grid, cannot overlap or be outside the grid. What is the least number of rectangles needed to achieve this covering... |
There is another way to do this problem, that doesn't involve any sort of conditional branching at all. It is in fact possible to set a fixed weighing schedule beforehand and still determine which ball is lighter or heavier in just 3 weighings. I'll explain how below.
-----
The gist of problems like these is, how... |
I hold the brightest of bright in a place with low light AND I am a place with low light that is not the night.
What am I?
Edit: The site wouldn't let me post the original version because it is not grammatically correct. I think it's better.
"Both brightest of bright and place with low light; what am I?"
Hi... |
Grid:
>! [![enter image description here][1]][1]
Explanations:
>! 1a. DISCO **DISC + O(-utkast)** Dance, but record OutKast first (5)
>! 3a. FLOPPY **P inside (PINK FLOYD - KIND)\*** Limp, soft inside, awkward: Pink Floyd not kind (6)
>! 7a. WINTER SPORTS **ddef** Coldplay performed at 2018 Olympics? (6,... |
[This is an extension of the discussion][1]
A robot is placed on a grid point. At each move the robot must take three steps along the edge of the grid. After each step the robot must turn right. Lengths of each step are $a$, $b$, and $c$ edges. It doesn't matter in which order $a$, $b$, $c$ are, since the trajector... |
Fighting against cheaters is a hard, uncertain and time-consuming; you can hamper cheating, but you cannot stop it.
Thing about online game editors that are constantly struggling against cheaters. Think also about [CAPTCHA's](https://en.wikipedia.org/wiki/CAPTCHA): for the last 20 years, this has been a neverending ... |
Fighting against cheaters is hard, uncertain and time-consuming; you can hamper cheating, but you cannot stop it.
Thing about online game editors that are constantly struggling against cheaters. Think also about [CAPTCHA's](https://en.wikipedia.org/wiki/CAPTCHA): for the last 20 years, this has been a neverending ar... |
It is well known that there is [no way](https://puzzling.stackexchange.com/q/462/70634) of arranging 4 queens on a checker board in such a way that every square is occupied or threatened.
Now consider a slight variation where we only need to cover one color:
> Can you place 3 queens on a standard 8x8 checker boar... |
second guess
>! Limelight
Brightest of bright in a place with low light
>! Limelight is both very bright literally as well as being used to describe someone enjoying attention in their field (in the limelight)
I am a place with low light that is not the night.
>! in addition to being in a dark theater, limelig... |
Second guess
>! Limelight
Brightest of bright in a place with low light
>! Limelight is both very bright literally as well as being used to describe someone enjoying attention in their field (in the limelight)
I am a place with low light that is not the night.
>! in addition to being in a dark theater, limelig... |
It is well known that there is [no way](https://puzzling.stackexchange.com/q/462/70634) of arranging 4 queens on a checker board in such a way that every square is occupied or threatened.
Now consider the case of racist queens who don't think black squares matter:
> Can you place 3 queens on a standard 8x8 checke... |
It is well known that there is [no way](https://puzzling.stackexchange.com/q/462/70634) of arranging 4 queens on a checker board in such a way that every square is occupied or threatened.
Now consider a slight variation where we only need to cover one color:
> Can you place 3 queens on a standard 8x8 checker boar... |
Is it the
>! MOON
?
I hold the brightest of bright in a place with low light:
>! The MOON is the brightest object in the night sky, which is certainly a place with low light.
I am a place with low light that is not the night:
>! To MOON someone is to reveal one's bare bottom, which is idiomatically r... |
_DISCLAIMER: This post has undergone political correction. As I have no intention to waste my sanity on arguing with the powers that be you better deal with it._
It is well known that there is [no way](https://puzzling.stackexchange.com/q/462/70634) of arranging 4 queens on a checker board in such a way that every s... |
<sub>This is in the spirit of the [What is a Word™/Phrase™][1] series started by [JLee][2] with a special brand of [Phrase™][3] and [Word™][4] puzzles.</sub>
------
If a word conforms to a special rule, I call it an Angered Word™.
Use the examples below to find the rule.
| Angered Words™ | Not Angered W... |
"HELLO World" has value 12, while "Puzzles are great" has value 223.
What is the value of "Puzzling StackExchange" ? |
You are given a 4x4 square grid. It has 16 cells and 25 intersections. Can you place 10 points at intersections, such that no three points lie on the same straight line? Lines can be oriented in any direction. **Bonus question:** can you find multiple solutions that are not rotations/mirrors of each other? |
You are given a 4x4 square grid. It has 16 cells and 25 grid intersections. Can you place 10 points at grid intersections, such that no three points lie on the same straight line? Lines can be oriented in any direction. **Bonus question:** can you find multiple solutions that are not rotations/mirrors of each other? |
This may be a question for a Maths forum, but was wondering if anyone has ever seen something that may guide me to a solution.
I am writing a Puzzling Site at the moment, which will naturally include Sudoku, and it struck me that there will be potential users that will try to cheat when solving puzzles, and by cheat... |
Mike the MMA* fighter and his fashion-model wife make a striking couple. They turn heads, especially when engaging in their favourite pastime - cosplay**.
Mike likes to dress as a fantasy hero, complete with sword and buckler while Wendy goes more for the delicate wood-elf look.
Whenever they have spare time from... |
You are given a 4x4 square grid. It has 16 cells and 25 grid intersections. Can you place 10 points at grid intersections, such that no three points lie on the same straight line? Lines can be oriented in any direction. **Bonus question:** can you find multiple solutions that are not rotations/reflections of each other... |
Mike the MMA* fighter and his fashion-model wife make a striking couple. They turn heads, especially when engaging in their favourite pastime - cosplay**.
Mike likes to dress as a fantasy hero, complete with sword and buckler while Wendy goes more for the delicate wood-elf look.
Whenever they have spare time from... |
*<sup>You can find other Vowelburgers™ Riddles [here](https://puzzling.stackexchange.com/search?q=vowelburger+is%3Aquestion)
</sup>*
I ordered 5 plain Vowelburgers™ with buns and meat - help me identify each one from the description on the menu!
| Meat | Vowelburger™ |
|:---------:|:------------:|
| A ... |
Fun with Letters, Words and Sentences? |
# Wrap-up: The Making Of _Banding Together_
_This is not a solution to the puzzle, but provides notes from its poser. This type of answer has been [approved by the community](https://puzzling.meta.stackexchange.com/questions/5420/)._
_**Caution:** This post contains spoilers._
---
## Origin/Methodology
>... |
<sub>This is in the spirit of the [What is a Word™/Phrase™][1] series started by [JLee][2] with a special brand of [Phrase™][3] and [Word™][4] puzzles.</sub>
-----------
If a word conforms to a special rule, I call it a Brutal Word™.
Use the examples below to find the rule.
| Brutal Words™ | Not... |
**Solution:**
>! The third person to say what color his hat was. The first man's hat was the same color as the second man's hat, and the third man's hat was the same color as the fourth's.
**Process:**
Here's an attempt at a more intuitive way to solve this. First, we add in a round zero in which we determine ... |
Suppose that, instead of playing in your turn, you have to submit in advance, an ordered list of the 9 board positions. Then a computer plays for you by using, whenever it is your turn, the leftmost position that is still untaken. For example, suppose you are "X" and you play first. Then the computer puts "X" in the fi... |
Mike the MMA* fighter and his fashion-model wife Wendy make a striking couple. They turn heads, especially when engaging in their favourite pastime - cosplay**.
Mike likes to dress as a fantasy hero, complete with sword and buckler while Wendy goes more for the delicate wood-elf look.
Whenever they have spare tim... |
There are two discrete ways to solve this Futoshiki puzzle, each with its own unique solution.
[![futoshiki board][1]][1]
Here is a [penpa-edit][2] (without the letters entered in case you want to use numbers instead), and here is a transcription:
```
[ ] [ ] [D] [ ] [ ]
v v ^
[ ] [ ] [U]<... |
There are two logical, discrete ways to solve this Futoshiki puzzle, each with its own unique solution. You can solve it using the letters given, or use the numbers 1-5. The rules of Futoshiki are:
1. Each row and column must contain one of each digit from 1-5 (or letter in "DUCKY").
2. All inequality constraints b... |
There are two* logical, discrete ways to solve this Futoshiki puzzle, each with its own unique solution. You can solve it using the letters given, or use the numbers 1-5, but if you map the letters to numbers, there must be a justification for how you map them (ie. you can't arbitrarily assign a letter to a number). Th... |
Mike the MMA* fighter and his fashion-model wife Wendy make a striking couple. They turn heads, especially when engaging in their favourite pastime - cosplay**.
Mike likes to dress as a fantasy hero, complete with sword and buckler while Wendy goes more for the delicate wood-elf look.
Whenever they have spare tim... |
Mike the MMA* fighter and his fashion-model wife Wendy make a striking couple. They turn heads, especially when engaging in their favourite pastime - cosplay**.
Mike likes to dress as a fantasy hero, complete with sword and buckler while Wendy goes more for the delicate wood-elf look.
Whenever they have spare tim... |
Mike the MMA* fighter and his fashion-model wife Wendy make a striking couple. They turn heads, especially when engaging in their favourite pastime - cosplay**.
Mike likes to dress as a fantasy hero, complete with sword and buckler while Wendy goes more for the delicate wood-elf look.
Whenever they have spare tim... |
It is well known that there is [no way](https://puzzling.stackexchange.com/q/462/70634) of arranging 4 queens on a checker board in such a way that every square is occupied or threatened.
Now consider a slight variation where we only need to cover one color:
> Can you place 3 queens on a standard 8x8 checker boar... |
There is another way to do this problem, that doesn't involve any sort of conditional branching at all. It is in fact possible to set a fixed weighing schedule beforehand and still determine which ball is lighter or heavier in just 3 weighings. I'll explain how below.
-----
The gist of problems like these is, how... |
It is well known that there is [no way](https://puzzling.stackexchange.com/q/462/70634) of arranging 4 queens on a checker board in such a way that every square is occupied or threatened.
Now consider a slight variation where we only need to cover one color:
> Can you place 3 queens on a standard 8x8 checker boar... |
How can 3 queens control the white squares? |
The street outside Rockefeller Center was a very busy place to hide a secret message, I thought, but sometimes the best place to hide something was in plain sight. I'm a government agent, from one of those alphabet agencies, investigating corruption in international song competitions. I was going to meet an unknown co... |
[![enter image description here][1]][1]
[1]: https://i.stack.imgur.com/acbyN.png
Under 30-secs. bullet time control the above position results after nth moves. What is the fewest number of moves posible? |
You are given a 5x5 square grid. Can you paint 12 cells, such that no 4 painted cells form the corners of a rectangle with sides parallel to the edges of the grid? Good luck! |
You are given a 5x5 square grid with 25 cells. Can you paint 12 cells, such that no 4 painted cells form the corners of a rectangle with sides parallel to the edges of the grid? Good luck! |
Same method as for [this previous similar question](https://puzzling.stackexchange.com/a/93792/5373):
- >! Put labels $A, B, C, D, E$ along the top for each column, then label the rows by certain *subsets* of the set $\{A, B, C, D, E\}$.
- >! 5 rows, so 5 different subsets.
- >! 12 painted cells, so the sizes of a... |
>
>
>A proverb and a myth, I will tell you a tale of two teams.<br />
I saw them last night in my dreams.<br />
The one team was sleeker, but started much weaker,<br />
The other was strong from the start.<br /><br />
Yes, the other was strong from the start.<br />
But we found that they had less heart.<br />
... |
<sub>*In the spirit of the What is a [Word™](https://puzzling.stackexchange.com/search?q=%22I+call+it%22+title%3A%22what+is%22+title%3Aword+is%3Aquestion)/[Phrase™](https://puzzling.stackexchange.com/search?q=%22I+call+it%22+title%3A%22what+is%22+title%3Aphrase+is%3Aquestion) series started by [JLee](https://puzzling.s... |
The message says:
>! `CONTACT CODENAME: NIGHTCORE`
Method:
>! Split the ciphertext into groups of 4 letters. For every group, shift the first letter alphabetically to the left by 1, the second letter to the right by 2, third letter to the left by 7 and fourth letter to the right by 3 (directions indicated by t... |
The message says:
>! `CONTACT CODENAME: NIGHTCORE`
Method:
>! Split the ciphertext into groups of 4 letters. For every group, shift the first letter alphabetically to the left by 1, the second letter to the right by 2, third letter to the left by 7 and fourth letter to the right by 3 (directions indicated by t... |
[![enter image description here][1]][1]
Under 30-secs. bullet time control the above position results after n moves. What is the fewest number of moves possible?
[1]: https://i.stack.imgur.com/acbyN.png |
Same method as for [this previous similar question](https://puzzling.stackexchange.com/a/93792/5373):
- >! Put labels $A, B, C, D, E$ along the top for each column, then label the rows by certain *subsets* of the set $\{A, B, C, D, E\}$.
- >! 5 rows, so 5 different subsets.
- >! 12 painted cells, so the sizes of a... |
<sub>This is in the spirit of the [What is a Word/Phrase™][1] series started by [JLee][2] with a special brand of [Phrase™][3] and [Word™][4] puzzles.</sub>
______
If a word conforms to a special rule, I call it a Doubtful Word™.
Use the following examples below to find the rule.
| DOUBTFUL WORD™ | NOT ... |
Gareth's answer is correct. Here's the proof I found before posting:
>! WLOG, since they're twin primes, say $q=p+2$. Then $p\;|\;(a+qb)$ and $q\;|\;(a+pb)$ means that $p\;|\;(a+2b)$ and $q\;|\;(a-2b)$; let's say $a-2b=k_1q$ and $a+2b=k_2p$. Then we have $$a=\frac{k_2p+k_1q}{2},\quad b=\frac{k_2p-k_1q}{4},$$ which m... |
Suppose we have a $3\times 3$ arrangement of lightbulbs and we switch them on/off randomly (probability $½$). What is the probability the no adjacent bulbs are on?
My attempt was:
Let $1= $ on and $0 =$ off. Then these are the only arrangements with both **no** adjacent $0$s or $1$s:
$$\pmatrix{ 0&1&0 \\ 1&0&1... |
Is it possible to build a gapless rectangle with non-integer side lengths using rectangles each with two integer side length and two non-integer side length?
The rectangles are not required to be the same size. |
Suppose we have a $3\times 3$ arrangement of lightbulbs and we switch them on/off randomly (probability $½$). What is the probability the no adjacent bulbs are on?
My attempt was:
Let $1= $ on and $0 =$ off. Then these are the only arrangements with both **no** adjacent $0$s or $1$s:
$$\pmatrix{ 0&1&0 \\ 1&0&1... |
Suppose we have a $3\times 3$ arrangement of lightbulbs and we switch them on/off randomly (probability $½$). What is the probability the no adjacent bulbs are on?
My attempt was:
Let $1= $ on and $0 =$ off. Then these are the only arrangements with both **no** adjacent $0$s or $1$s:
$$\pmatrix{ 0&1&0 \\ 1&0&1... |
I've made this up and I have no idea how easy or difficult it is.
___________________________________________________________________
Person A has two objects B and C. A performs an experiment in her living room. She places a 150cm high solid wooden box in the centre of the room and continues as follows.
A sta... |
A physics problem? Hmm... Let's see |
I've made this up and I have no idea how easy or difficult it is.
___________________________________________________________________
Person A has two objects B and C. A performs an experiment in her living room. She places a 100cm high solid wooden box in the centre of the room and continues as follows.
A sta... |
I've made this up and I have no idea how easy or difficult it is.
___________________________________________________________________
Person A has two objects B and C. A performs an experiment in her living room. She places a 100cm high solid wooden box in the centre of the room and continues as follows.
A sta... |
I've made this up and I have no idea how easy or difficult it is.
___________________________________________________________________
Person A has two objects B and C. A performs an experiment in her living room. She places a 100cm high solid wooden box in the centre of the room and continues as follows.
A sta... |
<sup>An entry in [Fortnightly Topic Challenge #49: Pub Quiz Camouflage](https://puzzling.meta.stackexchange.com/questions/7159/)</sup>
---
After a long day at the office with little to show for it, an evening at The Badger and Biscuit (his favourite pub) was exactly what Sergeant Sequence needed to unwind. Plus, ... |
A is Anna. B is a ball. Maybe C is
>! a Cat?
>! So friendly and forgiving that it doesn't mind being dropped to the floor and comes to rest at its owner's feet?
>! (it might be an automated cat then) |
Answers to the questions:
>! ...
>! 31. As a result of its shape, which variety of pasta is named after the Italian word for ‘butterfly’? **FARFALLE**
>! 32. Which animal cell organelles break down macromolecules, repair cell membranes, and destroy invading viruses and bacteria? **LYSOSOME**
>! 33. Which ... |
Quite simply, may White castle in the below position? There is much more than what meets the eye!
**Nikita M. Plaksin & Michel Caillaud, Feenschach 05/1982, 3. Prize**
[![enter image description here][1]][1]
[1]: https://i.stack.imgur.com/iU2gJ.png |
May White Castle? |
In this figure with two **non-congruent** equilateral triangles and three-fold rotational symmetry the distance between any two of the 6 edges is an integer. Can you give a solution?
I know only one solution.
If the two triangles are congruent the problem is much easier and there are many solutions.
![enter image... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.