instruction stringlengths 15 30k |
|---|
You are given a square piece of paper. You can cut it into pieces and rearrange them to form a new shape. You are allowed to rotate and flip pieces, provided that they are all used. Can you cut the square into pieces to form these shapes?
1. An equilateral triangle.
2. A regular hexagon.
3. A regular octagon.
4. ... |
Two videos have been made that investigate this topic in detail and explain who won each.
The first video about the Decipher puzzles has a good background. https://www.youtube.com/watch?v=meaUE2b5whI
The second video covers the Decipher II and III puzzles.
https://youtu.be/-XnCfS3ee8c
Karen Puzzles has detail... |
Two videos have been made that investigate this topic in detail and explain who won each.
The first video about the Decipher puzzles has a good background. https://www.youtube.com/watch?v=meaUE2b5whI
The second video covers the Decipher II and III puzzles.
https://youtu.be/-XnCfS3ee8c
Karen Puzzles has detail... |
What number should replace the question mark in the grid below? |
This is a question about pairs of anagrams capable of flavoring puzzles as memorable and surprising because the two words are so different.
One of my favorite such pairs is _chesty_ and _scythe_. These sound and look very different:
* two syllables; one syllable
* _c_ and _h_ together to represent the sound /t... |
Imagine a semi-infinite grid-line in which every box can hold any number of balls.
```
+--+--+--+--+--+--+--+--+--+--+--
| | | | | | | | | | | ... (infinity)
+--+--+--+--+--+--+--+--+--+--+--
```
The balls are a bit special as they can undergo fission and split up into two balls, each filling... |
You have an empty blackboard. At each step, you can either write two ones on the blackboard,
or erase two copies of a number n and replace them with n−1 and n+1.
What is the fewest number of steps it takes to write 100 on the board? |
Imagine a semi-infinite grid-line in which every box can hold any number of balls.
```
+--+--+--+--+--+--+--+--+--+--+--
| | | | | | | | | | | ... (infinity)
+--+--+--+--+--+--+--+--+--+--+--
```
The balls are a bit special as they can undergo fission and split up into two balls, one going in... |
Thanks to Stiv for solving the final cryptic clue
You did this to highlight the
>! TAGS
Matriarch mostly prepared oats for American airline location? (8)
>! The answer is **Sarasota**.
>! The matriarch is [Sarah](https://en.wikipedia.org/wiki/The_Legend_of_Mother_Sarah) from which we remove the last letter ... |
You are given a square piece of paper. You can cut it into pieces and rearrange them to form a new shape. You are allowed to rotate and flip pieces, provided that they are all used. Can you cut the square into pieces to form these shapes?
1. An equilateral triangle.
2. A regular hexagon.
3. A regular octagon.
... |
I found this puzzle in a Finnish magazine. I can't seem to figure it out.
[![From left to right, then top to bottom: 2, 6, 8; 3, 7, 3; 6, 4, ?][1]][1]
[1]: https://i.stack.imgur.com/6qk9o.jpg |
**Rules of Stostone**:
1. Shade exactly one stone, an orthogonally-connected group of cells, in each region.
2. No two stones in different regions are adjacent.
3. If a number is in a region, it tells the size of that region’s stone.
4. If you let the stones all fall down, they must cover exactly the bottom half ... |
Find what comes next in the following sequence:
0,1,4,9,7,7,9,13,10,9,1,?
Bonus: What is the rule? |
OP's Full Answer
--
This has been left idle for too long, plus JeremyDover has almost finished it, so imma accept that answer and post the true answer here:
>! [![enter image description here][1]][1]
Explanation and respective clues can be found [here :D](https://docs.google.com/spreadsheets/d/1SpLWOCswEFr7_... |
# Help!
I have outlined a puzzle below, and provided two sources which provide answers. I am disputing that the answer provided in the sources is correct, and I am looking for others to validate or invalidate my reasoning that the sources are incorrect.
# Puzzle
Three logicians (A,B and C) sit in a circle, eac... |
**Looking for feedback/validation!!!**
I wrote an exhaustive search script with the following python code:
```python
def solve(data, n=6):
# Who's turn? A=0,B=1,C=2
i = (n - 1) % len(data)
return {
x
for x in {
# the new hat configuration, subbing in
# t... |
**Looking for feedback/validation!!!**
I wrote an exhaustive search script with the following python code:
```python
def solve(data, n=6):
# Who's turn? A=0,B=1,C=2
i = (n - 1) % len(data)
return {
x
for x in {
# the new hat configuration, subbing in
# t... |
**Looking for feedback/validation!!!**
I wrote an exhaustive search script with the following python code:
```python
def solve(data, n=6):
# Who's turn? A=0,B=1,C=2
i = (n - 1) % len(data)
return {
x
for x in {
# the new hat configuration, subbing in
# t... |
I have outlined a puzzle below, and provided two sources which provide answers. I am disputing that the answer provided in the sources is correct, and I am looking for others to validate or invalidate my reasoning that the sources are incorrect.
# Puzzle
Three logicians (A,B and C) sit in a circle, each with a po... |
I wrote an exhaustive search script with the following Python code:
```python
def solve(data, n=6):
# Who's turn? A=0,B=1,C=2
i = (n - 1) % len(data)
return {
x
for x in {
# the new hat configuration, subbing in
# this round's candidates into the existing
... |
Find what comes next in the following sequence:
1,4,9,6,0,8,8,8,0,2,6,0,9,?
Bonus 1: What is the rule?
Bonus 2: Adding when someone solves Bonus 1 |
Find what comes next in the following sequence:
> 1,4,9,6,0,8,8,8,0,2,6,0,9,?
Bonus 1: What is the rule?
Bonus 2: Adding when someone solves Bonus 1 |
Find what comes next in the following sequence:
1,4,9,6,0,8,8,8,0,2,6,0,9,?
Bonus 1: What is the rule?
Bonus 2:
>! What numbers never appear when you do the rule to all numbers? |
I wrote an exhaustive search script with the following Python code:
```python
def solve(data, n=6):
# Who's turn? A=0,B=1,C=2
i = (n - 1) % len(data)
return {
x
for x in {
# the new hat configuration, subbing in
# this round's candidates into the existing
... |
Find what comes next in the following sequence:
1,4,9,6,0,8,8,8,8,0,2,6,0,0,?
Bonus 1: What is the rule?
Bonus 2:
>! What numbers never appear when you do the rule to all numbers? |
I think it is 0/3
Alternating we get:
3/2,3/4,3/8,...(pattern is (3/2)^(n+1))
2/3,1/3,?,...(pattern is 2/3-(n*1/3))
Following the pattern we get:
?=0/3
Next is:
3/16 |
I want to share a question that is created by myself.
I will give a hint in 24 hours and my answer in 3 days given that nobody could answer my question.
Here is my number sequence:
$3/2, 2/3, 3/4, 1/3, 3/8, ?$ |
Can you solve this Masyu puzzle? |
Two videos have been made that investigate this topic in detail and explain who won each.
The first video about the Decipher puzzles has a good background. https://www.youtube.com/watch?v=meaUE2b5whI
The second video covers the Decipher II and III puzzles.
https://youtu.be/-XnCfS3ee8c
Karen Puzzles has detail... |
I did it (created the tree) by hand
>! A only knows he has a number >0 and thus he has the sumvalue if B = C
>! So the statement (only) excludes {2y,y,y} for any value y
>! B:
>! B knows he has a number >0 and that {2y,y,y} is excluded
>! So the statement excludes {y,2y,y} and the other {2y,?,y) i.e. {2y,3... |
Partial answer only.
>! It appears that the words in the blacked out boxes have got mixed up so the rhymes don't match with the lines on the left hand side. It also looks as though the lines on the left hand side might clue words with unexpected spellings / pronunciations.
I found the following words, listing th... |
My whole is a path to finding a solution,
Yet part of me leads to my own recognition.
Herring has forever been one of my top tools,
I've always loved using it, especially against fools.
What can one do when they have one of me,
But struggle until they fail or succeed?
__________
What am I? (This is a... |
This puzzle is based on the "connecting wall" from the British tv show "Only Connect". The goal is to group the 16 words into 4 groups of 4 words that all share a property. Here are the words:
| | | | |
|:---:|:-----:|:-------:|:----:|
| MIX | LASER | RACECAR | EMPTY|
| SONAR| SCUBA| NOON| VIM|
| MOSSY| KAYAK| L... |
Can you solve the connecting wall? |
I have a feeling the answer is
>! Thread
My whole is a path to finding a solution,
>! A thread is a theme or characteristic running throughout a situation or piece of writing, e.g, a puzzle
Yet part of me leads to my own recognition.
>! **Read** is part of the word thread and through reading you can spot a th... |
You are given a biased coin. With probability $p$ it produces heads, where $p \neq 0,1$. How can you use this coin to simulate an unbiased coin, ie., a coin that produces heads with probability 0.5? |
You are given a biased coin. With probability $p$ it produces heads, where $p$ is in the range $(0,1)$. How can you use this coin to simulate an unbiased fair coin, ie., a coin that produces heads with probability 0.5? |
You are given a biased coin. With probability $p$ it produces heads, where $p$ is in the range $(0,1)$. How can you use this coin to simulate an unbiased fair coin, ie., a coin that produces heads with probability $0.5$? |
I am
> Half an idea
>
> Fifth of a cm
>
> Partly a reminder
>
> Fully a doctor
>
> And a desired statue
Who am I? |
Might 'you' actually be:
>! **ME**?
*Half an idea*
>! ME is half of **[MEME](https://en.wikipedia.org/wiki/Meme)**.
*Fifth of a cm*
>! ME makes up 20% of the 10-letter word 'CENTI**ME**TRE'.
*Partly a reminder*
>! ME makes up part of the word '**ME**MO'.
*Fully a doctor*
>! ME is an abbreviat... |
Might 'you' actually be:
>! **ME**?
*Half an idea*
>! ME is half of **[MEME](https://en.wikipedia.org/wiki/Meme)**. (Either half, in fact...)
*Fifth of a cm*
>! ME makes up 20% of the 10-letter word 'CENTI**ME**TRE'.
*Partly a reminder*
>! ME makes up *part* of the words '**ME**MO(RANDUM)', '**ME**... |
Mrs. Betty made a squared cake with chocolate frosting for his neighbors to the afternoon tea. However, first she sliced a middle piece for her two grandchildren and cut it in half:
[![enter image description here][1]][1]
There was no leftovers from the rest of the cake after the afternoon tea.
At the end of ... |
Mrs. Betty made a squared cake with chocolate frosting for his neighbors to the afternoon tea. However, first she sliced a middle piece for her two grandchildren and cut it in half:
[![enter image description here][1]][1]
There was no leftovers from the rest of the cake after the afternoon tea.
At the end of ... |
A lady had two jobs. One of her jobs was to teach a high school math class part-time. . She was teaching math terminology (prefixes and suffixes).
"Un(i) is 1.
Bi is 2.
Tri is 3.
Quad is 4.
Quince is 5.
...
And a dozen is 13."
What was the teacher's other part time job? |
Ok, let's see what we have to work with here. First of all, notice that
>!The teacher is terrible at her job. When teaching about "math" prefixes, she omits the most common math terms. Things that everyone knows - words like "Pentagon" (headquarters of the United States Department of Defense) is named as such because ... |
Partial answer only.
>! It appears that the words in the blacked out boxes have got mixed up so the rhymes don't match with the lines on the left hand side. It also looks as though the lines on the left hand side might clue words with unexpected spellings / pronunciations.
I found the following words, listing th... |
Here is a method that allocates fairly, including the iced corner:
We do not require two separate pieces, so we simply stack them.
Side view (apply 2x):
>! [![enter image description here][1]][1]
Kid 1 (1 piece):
>! [![enter image description here][2]][2]
Kid 2 (4 pieces):
>! [![enter image descrip... |
Here is a method that allocates fairly, including the iced corner:
We do not require two separate pieces, so we simply stack them.
Side view (apply 2x):
>! [![enter image description here][1]][1]
Kid 1 (1 piece):
>! [![enter image description here][2]][2]
Kid 2 (4 pieces):
>! [![enter image descrip... |
Here is a method that allocates fairly, including the iced corner:
We do not require two separate pieces, so we simply stack them.
Side view (apply 2x -> 4 cuts total):
>! [![enter image description here][1]][1]
Kid 1 (1 piece):
>! [![enter image description here][2]][2]
Kid 2 (4 pieces):
>! [![ent... |
Mrs. Betty made a squared cake with chocolate frosting for his neighbors to the afternoon tea. However, first she sliced a middle piece for her two grandchildren and cut it in half:
[![enter image description here][1]][1]
There was no leftovers from the rest of the cake after the afternoon tea.
At the end of ... |
Mrs. Betty made a squared cake with chocolate frosting for his neighbors to the afternoon tea. However, first she sliced a middle piece for her two grandchildren and cut it in half:
[![enter image description here][1]][1]
There was no leftovers from the rest of the cake after the afternoon tea.
At the end of ... |
can you help me with this? |
When Grandpa called, he sounded very unhappy.
"I am supposed to be in Paris but here I am stuck in a storm!", he grumbled.
"I am in the middle of nowhere. At the end of the line, front of the lobby, standing for hours. Trying to get a room for the night!"
"What city are you in Grandpa?" I asked
Then the cel... |
Stuck in a storm. Where is Grandpa? |
Take away half of me, I become unnatural
But give me your honey, I'll become an animal
I may ruin your day
But I'll always be followed by a ray
... And my prefix is a god... although Google thinks he's Arthritis.
-------
What am I? |
I have been trying to solve this for a while now and haven't gotten anywhere
> What is light but still dark, it's wet but dry. It has a name but it cannot be spoken. It ends in H
What is the answer? |
Here's my not entirely confident answer:
>! **CHAMPION** - ally, champ, vindicator, winner
>! **TREE** - advocate (??), copse, grove, timber
>! **POWER** - capability, capacity, influence, potential
>! **PROCESSOR** - brain, digital, mainframe, pc
>!
>! Final answer: **APPLE** - Champion apple variety... |
Since "non-coprimeness" (or more commonly, sharing a factor) is symmetric, (if A toggles B, then B will toggle A), and sharing more than one factor only counts once, we can draw a graph of "which number toggles which", and then the name of the game will be
>! All-ones Lights Out on an undirected simple graph.
An... |
Each of the positive integers from 1 to n is colored either black or white.
You can repeatedly choose a number m and recolor m together with those numbers, which are not coprime to m. At the beginning all numbers are white.
For which n is it possible to accomplish that all numbers are colored black? |
<sup>This is the [original puzzle](https://puzzling.stackexchange.com/questions/109752/a-variant-of-the-doctors-dilemma) with $n=2$. I recommend solving it before this one to get acquainted with the mechanisms.</sup>
There are $n$ patients in an hospital (let's call them $p_1 \dots p_n$), each of them need an operat... |
I remember this very old riddle involving lateral thinking.
> Girl is looking at an object. <br/>
During the flow of the time, it is becoming thinner at one side and thicker at another.
What is she looking at?
In addition, it has multiple solutions. Can you guess them all? I will give some hints.
1. Is toda... |
Mrs. Betty made a squared cake with chocolate frosting for his neighbors to the afternoon tea. However, first she sliced a middle piece for her two grandchildren and cut it in half:
[![enter image description here][1]][1]
There was no leftovers from the rest of the cake after the afternoon tea.
At the end of ... |
Fifteen related guests visited a restaurant and got into an argument about who was the greatest among them. To settle the dispute, they asked the owner to decide.
He thought for a moment, then said “While you are eating, write down as many stars as you can name. After the meal I will tally the results.”
The guest... |
You are a programmer, you are on your way home from your boring work when suddenly a psychopath hits you on the head, kidnaps you and brings you to their secret den.
You wake up in a dark room with only a laptop inside. You just located the door when you hear an electronically distorted voice: "Look at the laptop scre... |
Simplest I can think of is:
>! Open a new file explorer window, navigate to somewhere where there is already an empty folder, right click on it and choose copy, then click back to the original window and right click and paste. If there are no empty folders, copy a folder with stuff in it and then navigate into it an... |
For the first email:
>! The title appears to be the phrase "KEYBOARD LAYOUT" scrambled up. (Not sure if there's any additional significance to the way it's been mixed up.)
So trying to decipher the body:
>! In the first row, convert each letter to the letter which appears directly to its left on a standard QW... |
For the first email:
>! The title appears to be the phrase "KEYBOARD LAYOUT" scrambled up. (Not sure if there's any additional significance to the way it's been mixed up.)
So trying to decipher the body:
>! In the first row, convert each letter to the letter which appears directly to its left on a standard QW... |
There is a little bit of ambiguity in the requirements. Is it sufficient to
>! delete that one file, thus making the folder it used to be in an empty folder?
A bit less cheatily,
>! it seems like we could drag-and-drop from one of the things in the left sidebar, which would either move or copy into the current... |
> I am made of ice but hot as fire, I am soft but hard as rock
No other context to this riddle. What is the answer?
|
You are a programmer, you are on your way home from your boring work when suddenly a psychopath hits you on the head, kidnaps you and brings you to their secret den.
You wake up in a dark room with only a laptop inside. You just located the door when you hear an electronically distorted voice: "Look at the laptop scre... |
Let $n\gt 2$. I can do it by using no more than:
>! $g(n)\le n+\lfloor \frac{n}{2} \rfloor$
The strategy that establishes this bound is:
1. >! $d_i,i=1,\dots,\lfloor \frac{n}{2} \rfloor$ operate on $p_j,j=1,\dots,n$ by stacking gloves $(d_i,\emptyset)(\emptyset,p_j)$.
2. >! Next doctor $d_x$ operates using a... |
Let $n\gt 2$. I can do it by using no more than:
>! $g(n)\le n+\lfloor \frac{n}{2} \rfloor$
The strategy that establishes this bound is:
1. >! $d_i,i=1,\dots,\lfloor \frac{n}{2} \rfloor$ operate on $p_j,j=1,\dots,n$ by stacking gloves $(d_i,\emptyset)(\emptyset,p_j)$.
2. >! Next doctor $d_x$ operates using a... |
Let $n\gt 2$. I can do it by using no more than:
>! $g(n)\le n+\lfloor \frac{n}{2} \rfloor$
The strategy that establishes this bound is:
1. >! $d_i,i=1,\dots,\lfloor \frac{n}{2} \rfloor$ operate on $p_j,j=1,\dots,n$ by stacking gloves $(d_i,\emptyset)(\emptyset,p_j)$.
2. >! Next doctor $d_x$ operates using a... |
Let $n\gt 2$. I can do it by using no more than:
>! $g(n)\le n+\lfloor \frac{n}{2} \rfloor$
The strategy that establishes this bound is:
1. >! $d_i,i=1,\dots,\lfloor \frac{n}{2} \rfloor$ operate on $p_j,j=1,\dots,n$ by stacking gloves $(d_i,\emptyset)(\emptyset,p_j)$.
2. >! Next doctor $d_x$ operates using a... |
Lets have a 10x10 GRID with 12 empty bases. The rest of the grid is filled with tetrominoes.
With red color are marked the 5 regular tetrominoes and with green color the 2 reflections. Each base is marked with an orange color.
The following conditions apply:
1) The trail has to be continuous.
2) The trail is al... |
Let's have a 10x10 grid with 12 empty bases. The rest of the grid is filled with tetrominoes. The 5 regular tetrominoes are marked with a red color and the 2 reflections are marked with a green color. Each base is marked with an orange color.
The following conditions apply:
1) The trail has to be continuous.
2) T... |
Let's have a 10x10 grid with 12 empty bases. The rest of the grid is filled with skinny tetrominoes. The 5 regular tetrominoes are marked with a red color and the 2 reflections are marked with a green color. Each base is marked with an orange color.
The following conditions apply:
1) The trail has to be continuous.... |
You are given an unbiased fair coin, ie., a coin that produces heads with probability 0.5. Can you use this coin to simulate a biased coin that produces heads with some given probability $p$ ?
This is a reversal of my previous puzzle. Thanks to happystar for the idea. https://puzzling.stackexchange.com/questions/110... |
Yes, you can do it like this:
>! Start with the pair (0,1).
>! Then, repeat this process:
>! - Flip the coin.
>! - If it's heads, replace the pair $(x,y)$ with $(\frac{x+y}2,y)$.
>! - If it's tails, replace the pair $(x,y)$ with $(x,\frac{x+y}2)$.
>! Once both numbers in your pair are on the same side... |
The following sequence has been made using a specific pattern and the last number is kept secret. We have to find that number along with the pattern followed to make the sequence.
> 3, 11, 32, 71, 136, x
What is x? I was given this problem by a friend and I have been thinking about it for quite a while now but ... |
Can you fill the cells with integers so that all the equalities must be true?
[![enter image description here][1]][1]
[1]: https://i.stack.imgur.com/y1jS3.png |
Can you fill the cells by integers? |
An eccentric billionaire plays a game with you. She has an urn with 100 gold coins. Each time, you can take any number of coins from the urn. If you take n coins, she will flip a fair coin. If head, she adds one more gold coin to the urn. If tail, nothing happens. She stops flipping at the nth tail. After her flipping ... |
How many gold coins can you extract from the billionaire? |
A lower bound:
>! you can get (on average) at least 200 gold coins.
How?
>! Each time, take all the coins from the urn. The first time you take $100$ gold coins, the billionaire will toss the coin $100$ times and add $50$ coin in the urn (on average). The second time you take all those $50$ coins and the billi... |
The maximum expected number of coins you can get is
>! infinite
How can you get that much money?
>! Take all the coins from the urn. The billionaire will toss the coin until the 100th tails. This will happen (on average) after 200 throws: on average 100 heads and 100 tails. Thus the billionaire will put (on... |
The maximum expected number of coins you can get is
>! infinite
How can you get that much money?
>! Take all the coins from the urn. The billionaire will toss the coin until the 100th tails. This will happen (on average) after 200 throws: on average 100 heads and 100 tails. Thus the billionaire will put (on... |
My friend sent me an email this time. I had only just woken up, and was very sleepy (my head actually dipped down many times, but that helped me with this new problem.) It went like this:
Well, well, well. Good work with the first one, although it wasn't all that hard, was it? Well, here's another one. Find out the ... |
What is the maximum and minimum expected number of coins you can extract from the game?
>! They are both infinite. The question seems to imply that different strategies would lead to different expected outcomes, but for any $n$ you take, the billionaire is expected to add $n$ coins back into the urn.<p> The expecte... |
My friend was reading a newspaper and I caught a glimpse of a rather mystifying cryptic clue on one of the pages. I've been unable to solve it ever since and it's driving me crazy! Here's my "best" attempt, although it has *several* problems:
> K AR(A CT Y)T'S CT
Obviously, "karactytsct" is not an English word in... |
Attempt at a bit more rigor in an answer.
Consider first the strategy of taking 1 coin each turn:
>! What is the expected number of turns until the jar ends up with one fewer coin (after refilling)? Let this number be denoted $E_1$ and let $E_n$ be the expected number of turns before the jar ends of with $n$ fewe... |
How would you enter
> retsubkcolB
spelled backwards into the comment box below and press the "Add comment" button *(nothing will happen, as there's only 11 letters)* using **at most 10 clicks** in total?
You should end up with something like this:
> [![enter image description here][1]][1]
Requirements:
... |
>You have a white grid of size
**a)** 9x9
**b)** 10x10
and you are asked to paint some squares black. Your generous friend has given you a challenge:
>> Can you paint them so that each white square has _only_ one adjacent black square?
>
> After some puzzling around, you proudly present to your friend a p... |
How would you enter
> retsubkcolB
spelled backwards into the comment box below and press the "Add comment" button *(nothing will happen, as there's only 11 letters)* using **at most 10 clicks** in total?
You should end up with something like this:
> [![enter image description here][1]][1]
Requirements:
... |
Do you like cryptic crosswords and new ██████? So do I! Enjoy!
[![15x15 cryptic crossword grid][1]][1]
---
<sup>Note: While it's (hopefully) possible to deduce the missing word in the flavour text, doing so is a bonus challenge that isn't required to get the green check.</sup>
**Across**
1\. Summary abou... |
<sub>This is part 3 of the puzzle series that started at [Living the traveller's dream](https://puzzling.stackexchange.com/questions/109775/living-the-traveller-s-dream). Each part is solvable on its own.</sub>
----
[![enter image description here][1]][1]
> <i>Dear Puzzling,
>
> As I'm sure you know, I a... |
<sub>This is part 4 of the puzzle series that started at [Living the traveller's dream](https://puzzling.stackexchange.com/questions/109775/living-the-traveller-s-dream). Each part is solvable on its own.</sub>
----
[![enter image description here][1]][1]
> <i>Dear Puzzling,
>
> I hope you are well. This... |
Completed grid:
>! [![GladysPinkFloyd][1]][1]
Across clues
>! 5. (See 27 across)
>! DEAL + .E .R .S 7. Drug enforcers will expose their crimes, ultimately? (7)
>! (st -> A.)UDIO 9. Sound studio leader in acoustics for second time (5)
>! 10. (See 27 across)
>! 11. (See 24 across)
>! A. + P + ART 12. ... |
[Edit: Fixed formatting of answers]
Completed grid:
>! [![GladysPinkFloyd][1]][1]
Across clues
>! 7. Drug enforcers will expose their crimes, ultimately? (7)
>! DEAL + .E .R .S
>!
>! 9. Sound studio leader in acoustics for second time (5)
>! (st -> A.)UDIO
>!
>! 12. Individually arranged intr... |
The (mostly)-filled grid:
>! [![15×15 crossword grid][1]][1]
Clue explanations:
>! [![cryptic clue solutions with annotations][2]][2]
The unclued entry
>! is `_I_O_S`, and it's placed at 21A. Well, that's weirdly off-center - I wonder if the symmetrical entry is relevant? That entry is TRENCH... and a qu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.