instruction stringlengths 15 30k |
|---|
Here's (what I think is) a simpler proof of Albert's lemma than the one in loopy_wall's answer. We'll find either a king-path of 0-squares connecting N and S sides, or a king-path of 1-squares connecting W and E sides. The basic idea is to walk along the boundary between 0-squares and 1-squares until we reach an edge o... |
# TLDR Just the Puzzle
Given a number ***n*** and a weight ***w*** the function ***f*** will result in a weighted number ***r*** as follows.
***f(n, w) = r***
***n*** can be a number from **0 to 200** <br>
***w*** can be a number from **-100 to 100** (including 0)
**Some results using 100 as n: <br>**
f(... |
<sup>An entry in [Fortnightly Topic Challenge #49: Pub Quiz Camouflage](https://puzzling.meta.stackexchange.com/questions/7159/)</sup>
Your local pub has an interesting way to show their pub quiz questions--sixteen televisions in a four-by-four display. However, when you come in today, just as the quiz is suppose... |
Suppose I had a little robot on the coordinate grid that moves according to the following rule. If it's at the point $(x,y)$, it can move to either $(x+y,y)$ or $(x,x+y)$. If the robot starts at the point $(6,21)$ and can make any number of moves, what points could the robot go to? |
Given a grid filled with numbers, let's define a **King chain** to be a path on the grid such that
1. the path can be traversed with chess King's moves (moving to one of 8 adjacent cells at a time),
2. the numbers on the path are all equal, and
3. the path does not visit any cell more than once.
Also, let's def... |
Partial Answer:
>! 1) Audition,
>! 2) Canola,
>! 3) Carbuncle,
>! 4) Hive,
>! 5) Stock,
>! 6) Paprika,
>! 7) Tommy,
>! 8) Boil,
>! 9) Wart,
>! 10) Rash,
>! 11) Vinegar,
>! 12) Mole,
>! 13) House,
>! 14) Pimple,
>! 15) Tag,
>! 16) ???
>! From here it's clear that we... |
<sup>An entry in [Fortnightly Topic Challenge #49: Pub Quiz Camouflage](https://puzzling.meta.stackexchange.com/questions/7159/)...a day or two late. Oops.</sup>
Your local pub has an interesting way to show their pub quiz questions--sixteen televisions in a four-by-four display. However, when you come in today,... |
Partial Answer:
>! 1) Audition,
>! 2) Canola,
>! 3) Carbuncle,
>! 4) Hive,
>! 5) Stock,
>! 6) Paprika,
>! 7) Angelica (by @Stiv),
>! 8) Boil,
>! 9) Wart,
>! 10) Rash,
>! 11) Vinegar,
>! 12) Mole,
>! 13) House,
>! 14) Pimple,
>! 15) Tag,
>! 16) ???
>! From here it's... |
<sub> Inspired from https://puzzling.stackexchange.com/q/98238/51928 and https://puzzling.stackexchange.com/q/98175/51928 </sub>
-----------
In this puzzle we will use the English alphabet of 26 letters. We create a language that uses it and we call it $LANG$. Previously in https://puzzling.stackexchange.com/q/98... |
<sup>An entry in [Fortnightly Topic Challenge #49: Pub Quiz Camouflage](https://puzzling.meta.stackexchange.com/questions/7159/)...a day or two late. Oops.</sup>
Your local pub has an interesting way to show their pub quiz questions--sixteen televisions in a four-by-four display. However, when you come in today,... |
Partial Answer:
>! 1) Audition,
>! 2) Canola,
>! 3) Carbuncle,
>! 4) Hive,
>! 5) Stock,
>! 6) Paprika,
>! 7) Angelica (by @Stiv),
>! 8) Boil,
>! 9) Wart,
>! 10) Rash,
>! 11) Vinegar,
>! 12) Mole,
>! 13) House,
>! 14) Pimple,
>! 15) Tag,
>! 16) ???
>! From here it's... |
Partial Answer:
>! 1) Audition,
>! 2) Canola,
>! 3) Carbuncle,
>! 4) Hive,
>! 5) Stock,
>! 6) Paprika,
>! 7) Angelica (by @Stiv),
>! 8) Boil,
>! 9) Wart,
>! 10) Rash,
>! 11) Vinegar,
>! 12) Mole,
>! 13) House,
>! 14) Pimple,
>! 15) Tag,
>! 16) ???
>! From here it's... |
Grandpa had a lot of different books of stamps on his desk. He was counting them.
I was curious. “What are all those stamps Grandpa?”
“I just got back from the Post Office son and bought a bunch of different stamps! All books.”
“Yea? What did you get?” Not sure why I asked.
“Well, let’s see. Two books of I... |
Solved Slitherlink:
>! [![Completed Grid][1]][1]
>! I've added some annotations with the numbers corresponding to the green polygons, and also shaded to further differentiate the inside and outside of the fence (in case it bears any significance.
Now, getting the question from the solved grid:
>! If we note... |
To solve this, we need to examine more closely Grandpa's words when he says:
> *Two books of International stamps. One book of 75 cent stamps. And I got – 20 cent stamps, 50 cent stamps and also 55 cent stamps. That is it!*
Knowing that Grandpa spent exactly \$50.00 and bought 13 books, what can we say for sure?
... |
Solved Slitherlink:
>! [![Completed Grid][1]][1]
Now, getting the question from the solved grid:
>! If we note the number of sides used by the highlighted shapes and write them all together, we get the string 10127723165147052514546427056312254361. None of its digits is greater than 7 (because every shape has ... |
Given the country codes of 10 countries in the chart below, can you figure out the country code of Brazil?
| Country | Country Code™ |
| :---------: | :-----------: |
| Netherlands | AKC |
| Gibraltar | GID |
| Finland | HGB |
| Zimbabwe | HHE |
| Israel ... |
<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>
<hr>
If a word conforms to a special rule, I call it a **BFF Word™**.
Use the examples below to find the rule.
| BFF Words™ | Not BFF Words™ |
| :--... |
Grandpa had a lot of different books of stamps on his desk. He was counting them.
I was curious. “What are all those stamps Grandpa?”
“I just got back from the Post Office son and bought a bunch of different stamps! All books.”
“Yea? What did you get?” Not sure why I asked.
“Well, let’s see. Two books of I... |
<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>
<hr>
If a word conforms to a special rule, I call it a **Substantial Word™**.
Use the examples below to find the rule.
**Note: there is a rule for be... |
A follow-up to Dmitry Kamenetsky's [Objects that are countries or nationalities][1].
Can you figure out what these countries and nationalities are based on the clues?
| Country | Clue |
| :-----: | :-----------: |
| ? | nuts |
| ? | punched paper |
| ? | a pepper |
| ... |
<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>
<hr>
If a word conforms to a special rule, I call it an **?????? Word™**.
Use the examples below to find the rule.
| ?????? Words™ | Not ?????? Words™ ... |
<sup>Inspired by Avi's Vowelburger™ Riddle [here](https://puzzling.stackexchange.com/q/92931/18418) and Ébe Isaac's [Double Supreme](https://puzzling.stackexchange.com/questions/94590/vowelburger-double-supreme-1) Riddle.</sup>
The local Vowelburgers™ has added yet another a twist. They started making triple patty b... |
<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>
<hr>
If a word conforms to a special rule, I call it a **Rotting Word™**.
Use the examples below to find the rule.
| Rotting Words™ | Not Rotting Wor... |
<sup>Inspired by Avi's Vowelburger™ Riddle [here](https://puzzling.stackexchange.com/q/92931/18418).</sup>
$\text{Vowelburgers™}$ has decided to start changing things up a bit for bread connoisseurs and they have started making the $\text{Bread-lover's }$$\text{Double Supreme}$ with two consonant buns on the top, ... |
Supposing that your are playing Whites and your aim is to eat two black pieces in the fewest moves as possible and Blacks are not cooperating at all, and even more, Blacks' aim is to prevent you from doing so.
What would you be your fastest strategy in order to force black to buckle a piece?
Note: Blacks can capt... |
<sup>Inspired by Avi's Vowelburger™ Riddle [here](https://puzzling.stackexchange.com/q/92931/18418) and Ébe Isaac's [Double Supreme](https://puzzling.stackexchange.com/questions/94590/vowelburger-double-supreme-1) Riddle.</sup>
The local Vowelburgers™ [recently](https://puzzling.stackexchange.com/questions/94736/vow... |
<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>
<hr>
If a word conforms to a special rule, I call it a **Limited Word™**.
Use the examples below to find the rule.
| Limited Words™ | Not Limited Wor... |
<sub>This is inspired by the [What is a Word/Phrase™][1] series started by [JLee][2] with a special brand of [Phrase™][3] and [Word™][4] puzzles, and the [Number™][5] series.</sub>
-----------
If a number conforms to a special rule, I call it a Trinity Number™. Use the examples below to find the rule.
| Trinit... |
Given the country codes of 10 countries in the chart below, can you figure out the country code of Brazil?
| Country | Country Code™ |
| :------------: | :-----------: |
| Russia | NSR |
| Sudan | GDA |
| United States | BIE |
| Argentina | EGS ... |
Supposing that your are playing Whites and your aim is to eat two black pieces in the fewest moves as possible and Blacks are not cooperating at all, and even more, Blacks' aim is to prevent you from doing so.
What would you be your fastest strategy in order to force black to buckle those pieces?
Note: Blacks can... |
<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>
<hr>
If a word conforms to a special rule, I call it a **Vowelreuben™ Word™**.
Use the examples below to find the rule.
| Vowelreuben™ Words™ | Not V... |
Supposing that your are playing Whites and your aim is to eat a black piece in the fewest moves as possible and Blacks are not cooperating at all, and even more, Blacks' aim is to prevent you from doing so.
What would you be your fastest strategy in order to force Blacks to buckle a piece?
Now, what if you must e... |
<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... |
Grandpa had a lot of different books of stamps on his desk. He was counting them.
I was curious. “What are all those stamps Grandpa?”
“I just got back from the Post Office son and bought a bunch of different stamps! All books.”
“Yea? What did you get?” Not sure why I asked.
“Well, let’s see. Two books of I... |
<sup>Inspired by Avi's Vowelburger™ Riddle [here](https://puzzling.stackexchange.com/q/92931/18418).</sup>
*Vowelburgers™* has decided to start changing things up a bit for bread connoisseurs and they have started making the *Bread-lover's Double Supreme* with two consonant buns on the top, two consonant buns on t... |
I came up with this puzzle when I was in high school.
> There is an island owned by an evil man who keeps some tourists who were visiting the island a few years ago captive.<br>
> The authorities demanded him to tell them how many people he has imprisoned and he sent them a letter with a lot of scrambled numbers.<b... |
I came up with this puzzle when I was in high school.
> There is an island owned by an evil man who keeps some tourists who were visiting the island a few years ago captive.<br>
> The authorities demanded him to tell them how many people he has imprisoned and he sent them a letter with a lot of scrambled numbers.<b... |
Partial Answer:
>! 1) Audition,
>! 2) Canola,
>! 3) Carbuncle,
>! 4) Hive,
>! 5) Stock,
>! 6) Paprika,
>! 7) Angelica (by @Stiv),
>! 8) Boil,
>! 9) Wart,
>! 10) Rash,
>! 11) Vinegar,
>! 12) Mole,
>! 13) House,
>! 14) Pimple,
>! 15) Tag,
>! 16) ???
>! From here it's... |
I think Answer will be
>! 6 ??
Reason:
>! Sum of all first 3 numbers (A+B+C) in each column divide by 4th number (D) is result of last row.
>! **(A+B+C)/D**
>! (1+7+8)/4 = 4
>! (13+7+5)/5 = 5
>! (15+10+11)/? = 6
>! It seems in sequence next number might be 6 (4,5,6)
>! Number Six (6) will be r... |
Here's (what I think is) a simpler proof of Albert's lemma than the one in loopy_wall's answer. We'll find either a king-path of 0-squares connecting N and S sides, or a king-path of 1-squares connecting W and E sides. The basic idea is to walk along the boundary between 0-squares and 1-squares until we reach an edge o... |
I have an $8 \times 8$ board. On the board, I want to choose 2 unit squares in each column and row such that none of the chosen squares are touching. This means they cannot share a side or a corner. How many ways can I choose the unit squares? What if the board is $9 \times 9$?
Now, I want to choose 3 unit squares i... |
<sup>Inspired by Avi's Vowelburger™ Riddle [here](https://puzzling.stackexchange.com/q/92931/18418) and Ébe Isaac's [Double Supreme](https://puzzling.stackexchange.com/questions/94590/vowelburger-double-supreme-1) Riddle.</sup>
The local Vowelburgers™ has added a new item to their ever-expanding menu, the Inside-O... |
Given a grid filled with numbers, let's define a **King chain** to be a path on the grid such that
1. the path can be traversed with chess King's moves (moving to one of 8 adjacent cells at a time),
2. the numbers on the path are all equal, and
3. the path does not visit any cell more than once.
Also, let's def... |
Grandpa had a lot of different books of stamps on his desk. He was counting them.
I was curious. “What are all those stamps Grandpa?”
“I just got back from the Post Office son and bought a bunch of different stamps! All books.”
“Yea? What did you get?” Not sure why I asked.
“Well, let’s see. Two books of I... |
Suppose that you are playing White, and your aim is to eat a black piece (pawns qualitfy) in the fewest moves as possible and Black are not cooperating at all, and, even more, Black's aim is to prevent you from doing so.
What would you be your fastest strategy in order to force Black to buckle a piece?
Now, what ... |
Partial answer (9x9 still missing):
8x8:
>! 2 ways: <pre>
>! . X . X . . . .
>! . . . . . X . X
>! . X . X . . . .
>! . . . . . X . X
>! X . X . . . . .
>! . . . . X . X .
>! X . X . . . . .
>! . . . . X . X .
>! </pre>
>! and the same mirrored.
Why not more?
>! W... |
8x8:
>! 2 ways: <pre>
>! . X . X . . . .
>! . . . . . X . X
>! . X . X . . . .
>! . . . . . X . X
>! X . X . . . . .
>! . . . . X . X .
>! X . X . . . . .
>! . . . . X . X .
>! </pre>
>! and the same mirrored.
Why not more?
>! We can count grid points: The no-touchin... |
8x8:
>! 2 ways: <pre>
>! . X . X . . . .
>! . . . . . X . X
>! . X . X . . . .
>! . . . . . X . X
>! X . X . . . . .
>! . . . . X . X .
>! X . X . . . . .
>! . . . . X . X .
>! </pre>
>! and the same mirrored.
Why not more?
>! We can count grid points: The no-touchin... |
I think the answer is
>! 19???
Columns:
>! If you look at the number of letters in the number itself, and add them all up in the column (Except the number in row 4, which is at the bottom, so add the number itself.) Keep doing this until i got these numbers:
>! 13 and 19. These numbers make it so that the sum... |
I saw [this game][1] on Steam that's not yet released. They have a demonstration of the game in video form [here][2], and here's the GIF I generated from that video *(that's lower in quality and shortened due to the maximum 2 MB required to post)*:
[![enter image description here][3]][3]
Basically, a cactus grow... |
>When in red, I was very loud.
In high definition, a treasure.
You put me in to interfere.
Rest on me for your leisure.
>
>Put me between the last two letters,
I am an Asian plant.
Keep some of me in the water,
And being unsettled you can't.
**What am I?**
**Please explain each line in you... |
Sometimes with Feathers? |
<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... |
Surely you must be
>! an **oar**.
When in red, I was very loud.
>! r**oar**ed
In high definition, a treasure.
>! h**oar**d
You put me in to interfere.
>! to "put an oar in" is an idiom for interfering in other people's business
Rest on me for your leisure.
>! "rest on your oars" is an idiom a... |
I came up with this puzzle when I was in high school.
> There is an island owned by an evil man who keeps some tourists who were visiting the island a few years ago captive.<br>
> The authorities demanded him to tell them how many people he has imprisoned and he sent them a letter with a lot of scrambled numbers.<b... |
This puzzle is an extension of this one: https://puzzling.stackexchange.com/questions/107347/minimize-the-longest-king-chain-on-a-5x5-binary-board
Given a grid filled with numbers, we define a **King chain** to be a path on the grid such that:
1. The path can be traversed with chess King's moves (moving to one of... |
This puzzle is an extension of this one: https://puzzling.stackexchange.com/questions/107347/minimize-the-longest-king-chain-on-a-5x5-binary-board
Given a grid filled with numbers, we define a **King chain** to be a path on the grid such that:
1. The path can be traversed with chess King's moves (moving to one of... |
Two knights are placed on opposite corners of a 4x4 grid. Can you move* each knight 8 times, such that each cell of the grid is visited exactly once by exactly one of the knights?
*Note that a knight moves 1 cell in one direction (horizontal or vertical) and two cells in an orthogonal direction. |
Two knights are placed on opposite corners of a 4x4 grid. Can you move* each knight 7 times, such that each cell of the grid is visited exactly once by exactly one of the knights?
*Note that a knight moves 1 cell in one direction (horizontal or vertical) and two cells in an orthogonal direction. |
The puzzle is as follows:
> How many straight lines do you need to draw the least possible to join
> all the smiling toasters if you should not raise the pen or go over
> any line already drawn? Remember that it is allowed to cross.
>
> [![Sketch of the problem][1]][1]
The alternatives given are as follows:
... |
How many lines are needed to connect the smiling toasters? |
The puzzle is as follows:
> How many straight lines do you need to draw the least possible to join
> all the smiling toasters if you should not raise the pen or go over
> any line already drawn? Remember that it is allowed to cross.
>
> [![a 4-by-4 grid of smiling toasters][1]][1]
The alternatives given are ... |
How many lines are needed to connect all smiling toasters in a 4x4 grid? |
The puzzle is as follows:
> The figure from below represents a set of 12 squares joined forming a
> closed loop. By using only the numbers from 1 to 12 fill in the
> blanks.
>
> The condition is that, without repeating any number. It must be
> fulfilled that the sum of the four values written along each side ... |
How to get the least possible sum in a closed loop set of squares? |
The puzzle is as follows:
> The figure from below represents a set of 12 squares joined forming a
> closed loop. By using only the numbers from 1 to 12 fill in the
> blanks.
>
> The condition is that, without repeating any number. It must be
> fulfilled that the sum of the four values written along each side ... |
One possible answer is
>!<pre>. 2 . .
>!. . 6 3
>!5 . 1 .
>!0 . 4 7
>!
>!7 . 5 0
>!4 1 . .
>!. 6 . 2
>!. 3 . .</pre>
It doesn't look very symmetric at first glance, but if you look more closely,
>! Both knights exit the corner (0-1), cycle through four cells on the sides (2-5), and then enter another c... |
The puzzle is as follows:
> By only using matchsticks of equal length it has been built a set of
> equilateral triangles as indicated in the figure from below. Relying
> in that information, What is the minimum number of matchsticks that
> must be removed so that there isn't any of those triangles?
>
> [![Sket... |
How many matchsticks are needed to be removed to get none triangles? |
If a word conforms to a special rule I call it a First Order Word™
| First Order™ | Not First Order™ |
|:----------------:|:----------------:|
| Worry | Worried |
| Typo | Correct |
| Rye | Wheat |
| Rip | Ripped |
| Tow ... |
The puzzle is as follows [with minor copy edits for grammar]:
> By only using matchsticks of equal length a set of equilateral triangles has been built as indicated in the figure from below. With that information, what is the minimum number of matchsticks that must be removed so that there aren't any of those triang... |
How many matchsticks need to be removed so there are no equilateral triangles? |
How do you generate Density puzzle bitmaps? I've seen a lot of Density puzzles (such as [this one](https://puzzling.stackexchange.com/questions/90049/the-first-density-puzzle) and want to know how the images were made. |
How do you generate Density puzzle bitmaps? |
<sup>An entry in [Fortnightly Topic Challenge #49: Pub Quiz Camouflage](https://puzzling.meta.stackexchange.com/questions/7159/)...a day or two late. Oops.</sup>
Your local pub has an interesting way to show their pub quiz questions--sixteen televisions in a four-by-four display. However, when you come in today,... |
This puzzle is an extension of this one: https://puzzling.stackexchange.com/questions/107347/minimize-the-longest-king-chain-on-a-5x5-binary-board
Given a grid filled with numbers, we define a **King chain** to be a path on the grid such that:
1. The path can be traversed with chess King's moves (moving to one of... |
Partial Answer:
>! 1) Audition,
>! 2) Canola,
>! 3) Carbuncle,
>! 4) Hive,
>! 5) Stock,
>! 6) Paprika,
>! 7) Angelica (by @Stiv),
>! 8) Boil,
>! 9) Wart,
>! 10) Rash,
>! 11) Vinegar,
>! 12) Mole,
>! 13) House,
>! 14) Pimple,
>! 15) Tag,
>! 16) ???
>! From here it's... |
Feeling adventurous, I decided to have a party, so I invited my friends: Astrid, Connor, Clinton, Lewis, and Michael. What's my name?
There could be a few possibilities, but there's only one right answer.
Hint:
>! Connor isn't really skilled at anything, but he's vital to our group. |
The Bongard problems on the 1 side of the Meta-Bongard are all easy to solve (Numbers are OP's reference system):
**1A**:
>! Nothing | Something
**1B**:
>! White shape | Black shape
**1C**:
>! Square | Non-Square Rectangle
**1D**:
>! Big thing | Small thing
**1E**:
>! Threesome | Foursome
*... |
The Bongard problems on the **1** side of the Meta-Bongard are all easy to solve (Numbers are OP's reference system):
**1A**:
>! Nothing | Something
**1B**:
>! White shape | Black shape
**1C**:
>! Square | Non-Square Rectangle
**1D**:
>! Big thing | Small thing
**1E**:
>! Threesome | Foursome
... |
*<sup>Inspired by Avi's Vowelburger™ Riddle [here](https://puzzling.stackexchange.com/q/92931/18418)</sup>*
I’ve opened a new French restaurant named Vozzellbaugor™, an entirely original and unstolen idea. My restaurant has come out with a new line of food called Surprise Fries: french fry burgers with two secret in... |
[![enter image description here][1]][1]
You were at your neighborhood barbeque when noticed a lady reporting a theft to the police.
This is what you heard:
Lady: *Help! A man grabbed my purse and ran away!*
Police: *Did you notice anything about him that can help us identify him?*
Lady: *Yes, he had a pla... |
[![A yellow flyer with orange border. The top says "Barbeque on Sunday!" in large font. Right below is "You're invited to join us on our front lawn for a barbeque." In a white box near the bottom is "MENU:", then three lines of italicized food items, "Lamb chops & Steak", "Carrots & Peas", "Soda & Iced tea".][1]][1]
... |
If a word conforms to a special rule, I call it an Ordered Word™.
Use the examples below to find the rule.
| Ordered Words™ | Not Ordered Words™ |
|:------------------:|:------------------:|
| CAT | DOG |
| BACK | FRONT |
| NO | YES ... |
<sup>An entry in [Fortnightly Topic Challenge #50: Escape Rooms](https://puzzling.meta.stackexchange.com/questions/7172/)</sup>
---
I open my eyes to find myself lying in a bed in a white room. Sitting up is difficult, as a tangle of wires and tubes are attached to my arms and chest. I'm in hospital. But I have n... |
I was solving a crossword in my local newspaper when I came across a clue that made no sense:
19 Across: Be inappropriate
On the face of it, there is nothing odd with this clue until I realised: 19 Across didnt exist!
The only other puzzle on the page which could explain this printing error was a Find-A-Wo... |
I was solving a crossword in my local newspaper when I came across a clue that made no sense:
> 19 Across: Be inappropriate
On the face of it, there is nothing odd with this clue until I realised: 19 Across didn't exist!
The only other puzzle on the page which could explain this printing error was a Find-A-Wor... |
I was solving a crossword in my local newspaper when I came across a clue that made no sense:
> 19 Across: Be inappropriate
On the face of it, there is nothing odd with this clue until I realised: 19 Across didn't exist!
The only other puzzle on the page which could explain this printing error was a Find-A-Wor... |
This is a puzzle I love to play with my math students and I hope you will enjoy it too:
You are given the numbers **1,2,3,4 and 5 exactly once**.
Your target is a number, e.g. 36. Can you create a calculation with addition, subtraction, multiplication, division and parantheses, s.t. you arrive at this number?
... |
If amateur fiction is not your thing skip to the bottom.
As IP (Implausible Physics) expert for DREAM, the Department for Reckless Engineering and Advanced Megalomania you have been tasked by sheikh Shanzaar
himself with ascertaining the safety of a new system of bridges joining for the first time Ping and Pong, th... |
If amateur fiction is not your thing skip to the bottom.
As IP (Implausible Physics) expert for DREAM, the Department for Reckless Engineering and Advanced Megalomania you have been tasked by sheikh Shanzaar
himself with ascertaining the safety of a new system of bridges joining for the first time Ping and Pong, th... |
If amateur fiction is not your thing skip to the bottom.
As IP (Implausible Physics) expert for DREAM, the Department for Reckless Engineering and Advanced Megalomania you have been tasked by sheikh Shanzaar
himself with ascertaining the safety of a new system of bridges joining for the first time Ping and Pong, th... |
If amateur fiction is not your thing skip to the bottom.
As IP (Implausible Physics) expert for DREAM, the Department for Reckless Engineering and Advanced Megalomania you have been tasked by sheikh Shanzaar
himself with ascertaining the safety of a new system of bridges joining for the first time Ping and Pong, th... |
Really enjoyed creating this kind of puzzle, here's another one.
If a word conforms to a special rule I call it an Elegant Word™
| Elegant Words™ | Not Elegant Words™ |
|:------------------:|:------------------:|
| VISCOUS | FLUID |
| JOINING | MERGING |
| PUBLI... |
<sup>This puzzle follows from the [Purple Periodic Puzzle](https://puzzling.stackexchange.com/questions/107514/the-purple-periodic-puzzle) (these puzzles are solved individually).</sup>
Another strange periodic table has appeared and it's hiding a secret word.
Can you find out what's strange about this green peri... |
<sup>This puzzle follows from the [Purple Periodic Puzzle](https://puzzling.stackexchange.com/questions/107514/the-purple-periodic-puzzle) (these puzzles are solved individually).</sup>
Another strange periodic table has appeared and it's hiding a secret word.
Can you find out what's strange about this green peri... |
This is a puzzle I love to play with my math students and I hope you will enjoy it too:
You are given the numbers **1, 2, 3, 4, and 5 exactly once**.
Your target is a number, e.g. 36. Can you create a calculation with addition, subtraction, multiplication, division and parentheses, so that you arrive at this num... |
Two stereotypical british gentlemen that don't know each other engage in this unusual conversation (it's almost as if they were a setup for a puzzle):
> **Gentleman A** - Hello sir, I'll have you know that next month, I'll turn 49.
> **Gentleman B** - What a coincidence, next month is my birthday too, though I'll... |
The wrong elements
>! seem to be switched in pairs:
>!
>! [![enter image description here][1]][1]
So what do we do with this?
>! The atomic numbers here don't have any zeroes, and there's a fairly even distribution of digits - all of the nonzero digits appear at least once.
>!
>! We can choose one ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.