For full meta effect, I should beat Deusovi to the answer before he sees this puzzle ... :->
This puzzle can actually be analysed quite rigorously ...
Let $A_n,B_n,C_n,X_n,Y_n,Z_n$ be the six entrances/exits to the $n$th largest triangle. Thus, ...
Since we alternate between increasing and deceasing, we can color the maze like a checkerboard, where we alternate between black and white. This means that whenever we go from black to white we always have to increase, and when we go from white to black we always have to decrease (or vice versa, depending on your coloring).
If something is increasing in one ...
This question already has very good answers, but I wanted to share my intuition for why the given maze has no solution. This is a visual approach to the problem that I find a lot easier to grasp. It is however not a rigorous proof.
This approach strives to demonstrate that the maze is equivalent to two disjoint paths infinitely spiraling towards each other. ...
Here is a link to a prezi. If there is anyway to export it that would be great but I'm not exactly sure how it works.
Just keep clicking next through it.
And the path in the format from-to (level). If the number includes a letter it comes from/goes to an internal ...
As per @Henkie's post, the second door from EXAMPLE ROOM solved
GET TWO FREE solved
MAZES IN MAZES solved
HALF THE PICTURE solved
MIND GAMES solved
WHERE ARE YOU? solved
ILL OMENS solved
GOAL IN SIGHT solved
BLOCK CIPHER solved
Note though that this only works because this particular maze has no straight moves available (i.e. intersections where you can't turn but only go forward). For example, using the same rules, if you remove the vertical line directly below the 2x1 block...
1. I started with the left room. The key for this room is
2. Next note that
3. Next note that
So we have
6. Almost finally...
8. For completeness
If going over the same path twice is allowed, this is a probable solution. I just started at the end and worked my way backwards to the start since there is only one possibility for the second-last tile (the other red tile would have resulted in an infinite loop)
Since I obviously cannot accept any answer (If I actually got Deusovi's attention stuck in the maze, the appearance of a green tick would ruin everything), and this seems to be getting reasonably much attention, I thought I could post a kind of "Making of" featurette for the maze that goes through some of the features that weren't yet mentioned elsewhere.
Here's a maze of mine.
Start at the top left square. End at the bottom right.
RULES: You must stay on a color for exactly THREE squares. You may not do a U-turn (return to the square you just came from) at any time.
Like most mazes, it's easier to solve working backwards. But it's definitely very difficult going forwards.
EDIT: will continue to update ...
Sure you can. There's finitely many possible mazes, so solve each one in sequence. To solve a maze, imagine you're in that maze. Figure out where you are in the maze by simulating starting on the start space and following the instructions corresponding to the sequence of steps you've taken so far. Then, make the moves that would take you from there to the ...
MASSIVE SPOILER ALERT, DO NOT LOOK UNLESS YOU REALLY HAVE GIVEN UP
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 ...
The solution is this path:
The clues that give it to us:
The complete list of connections is:
Here's the spreadsheet where we all figured this out; I've made copies at various times so you can see our progress. Many of the words are also highlighted in the sheet (though I'm sure we've missed some).
I am not very familiar with these monsters, but after some research I would name them like this:
If I combine the path through the maze with the names of the creatures living in the rooms I get
So the word is
The solution is
The crossword was first solved by @NeilW, and @Sconibulus solved the alphametic and the maze (go upvote them!).
For the Sudoku:
For the Anagram:
For the Logic puzzle:
Back to the Sudoku:
Finally to the Maze:
Here it is. Access the direct link to see it in its full size (or zoom-in the image).
This is a plane of boards (horizontal is $w$ and vertical is $z$) where each board is a 2D-plane (horizontal is $x$ and vertical is $y$). To change your $x$ and $y$ positions, just walk around in the current board.
The arrows allows you to change your $w$ and $z$ ...
A very well-written puzzle! And very good visualization! This site needs more good puzzle-writer like you =D
Guess it must be very troublesome to fit all those mazes and turns using the simple rule. Good job!
1. What simple rule/strategy is Bob using to get through Edwards labyrinths?
From the question, I believe the simple rule is:
Let's see how that ...
Here are all 48 solutions to the maze with no repeated squares (shortest first):
The maze actually has some isolated or unreachable components, and one component that is isolated unless you pass through the goal cell:
The cryptic clues:
Parses dysfunctional extras.
Vehicle decay is orange.
Sounds like grace upon toxin.
Messy rats begin Abraham Lincoln's cosmically related business.
Female birch, Australian Pine.
Layout inappropriate expenditure.
We can arrange these answers in the grid
Now, notice that
Let's assume such a sequence exists, and fix a working sequence. Clearly, this sequence does not contain an equal number of NORTH and SOUTH directions, otherwise the robot would return to the starting cell in an infinite 1-wide north-south corridor. The same goes for WESTs and EASTs.
Without loss of generality, we can assume there are more NORTHs than ...