56
49
@Jay already found the solution to this, but I wanted to expand a little more on why it's the only solution:
43
Partial solution
36
The solution is:
or, in text form:
Explanation (not the fastest way, I realized some improvements while writing it):
32
For the sake of completeness, there are actually 3 possible solutions. Using process of elimination and deduction can get you to this point:
One solution is given by Sid already:
But two more are:
and:
29
Here's the solution: I will provide the explanations within the next 24 hours because now I have to go to bed.
28
The next part of this puzzle can be found at:
How I got this:
So, what to do next:
28
Armed with Thomas Blue's star-finding work, we may solve the 4 logic grids as follows:
The rules of the puzzle
Step by step solution:
Grid 1
Grid 2
Grid 3
Big grid
Here begins speculation
28
The completed dish
The reasons why
The ultimate message
Follow the directions
My answer
27
Some quick terms I should define:
'Number chasing' - a strategy similar to sudoku where you focus on a single number, and figure out where that number must appear in some region. Can be applied to place many of the same number around the grid, or to fill out a region totally.
'Can't be anything else' - focusing on a single cell, and working out the only ...
26
Final solution
Step-by-step explanation
In each of the 2x2 boxes with determinant 0, we have four numbers $a,b,c,d$ between 1 and 9 such that $ad=bc,a\neq b\neq d\neq c\neq a$. This leaves surprisingly few possibilities:
The only possibilities for the pairs $\{a,d\},\{b,c\}$ (unordered in all ways; these are just two pairs with equal products) are:
{1,9},...
25
Transmission from the moon radio-station
After a long time in space I started to forget what N and E stand for on Earth. Well, now it's clear to me: East and North are directions. The first time I tried to get through those Space Grids, I mixed them up and also tried to take clues from the spectrum... Oops, let me get the spoiler glasses on. I might talk ...
25
From some lines of the poem:
we can figure out that
Turns out there's exactly one way to do this.
And now, the sequence:
23
What a fun puzzle!
Green means a note.
Blue means an important deduction.
Red means can be deduced by shallow sudoku logic, or shallow slope logic (I.e. If you have a 1 and 3, a 2 goes in between.)
Start off by focusing on 1s and 8s, because they're limited in where they can go (they have to be in a corner). In particular, that top middle area let's us ...
23
MASSIVE SPOILER ALERT, DO NOT LOOK UNLESS YOU REALLY HAVE GIVEN UP
Full solution.
No words needed.
(Hopefully there are no mistakes)
Plus, the lines and text were fully hand-drawn for those of you who still appreciate hand-drawn art stuff. I seriously doubt that anybody is actually going to try reconstructing my solution, but if you have any parts that ...
23
I claim that
The proof:
22
Resident Grid Detective checking in to drop off the answer to this lovely puzzle. Step by step pics coming soon.
Step by step ish:
22
Answer
Step-by-step solution
21
EDIT : wrote the complete answer.
Take a look at the grid submitted by OP.
There's also those intriguing blue squares.
We can move on.
I'm struggling with the 'spoiler' blocks.
Here comes my original work (I feel like a fraud ^^)
and the hint of OP
This made me think of
Fiddling with the versions, one was right on it.
So to your question "who am i ...
21
Answer for the question mark:
Solution:
Working:
21
I was working this independently of QuantumTwinkie, but I think the crossword portion is solved:
The other bit/two bits of this puzzle is that
The final grid looks like this:
Thanks for the puzzle!
20
Full details on individual clue answers in this sheet. Thanks to Beastly Gerbil, boboquack, elias, Rubio, and Sid for the help.
Part 1: Assembly and Cryptics
Part 2: Matching and More Cryptics
Part 3: Masyu
Part 4: The Key
Part 5: Unlocking
19
The solution is as follows:
My Java-based solver is viewable here.
The solver is a quasi-brute-forcer with efficient backtracking. The major headache was that I initially assumed both "wells" in piece 9 were simultaneously full or empty. However, no solution exists for either of these cases. Much time was spent trying to figure out what was wrong with the ...
18
(Partial)
Like Deusovi pointed out, it appears that this is puzzle is probably the net of an icosahedron, and so this puzzle is actually in 3D.
Clearly the 3D is scary, and trying to solve it as-is will make both the solver and the reader bored. So...
X'ing out the edges of the 0 triangle reveals some basic deductions:
Now...
Also noteworthy:
Now look:
...
18
I believe this works (under the assumption that paths consist only of the squares visited by each piece, not by the lines created, allowing diagonal lines to "cross" each other, and the knights' obvious need to "jump"):
18
I think @Jay and @PilsNot3 have it right and that their solutions fit what the OP intended best. However, on the off chance that the OP has a different definition of "contiguous", a few extra possibilities open up. Below are some that I could find that rely on "contiguous" allowing
Top left is @Jay's solution and probably the intended one. The other ...
17
It has come to my attention that someone has beat me to it while writing my answer, but I am proud of my work so to compensate for wasting stackexchange server space I will make my answer very colorful.
Completed puzzle:
Complete Explanation (unspoilered) (why did you scroll down here if you didn't want the answer smh):
Single cell groups must have a 1, ...
17
Wrap-up: The Making Of GRID-THIRTY-SIX
This is not a solution to the puzzle, but provides notes from its poser. This type of answer has been approved by the community.
Caution: This post may contain spoilers.
The first thing I did was "made a mistake"
Yup! The italicised and struck-through 'made a mistake' was a prototypical cryptic from a while back, ...
17
Final solution
Detailed explanation
Right at the beginning, we can tell that certain sets of cells must all contain the same number. Starting from the extreme bottom right cell, we can find a sequence of equal numbers (say this number is A) by considering each bold-framed area in turn starting from the bottom left and working to the right. This gives us a ...
Only top voted, non community-wiki answers of a minimum length are eligible
