Hot answers tagged


For full meta effect, I should beat Deusovi to the answer before he sees this puzzle ... :-> $\def\G #1{\color{lime}{\text{#1}}}$ $\def\R #1{\color{red}{\text{#1}}}$ $\def\B #1{\color{blue}{\text{#1}}}$ 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, ...


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. ...


My path (red blotches are bombs) Explanation: Here I have highlighted important walls in purple, splitting the maze into sections. Anywhere within a section is reachable without a bomb. Going between sections is impossible without a bomb NOTE: Everything below this has been edited. I'm combining some suggestions made in the comments to give a better ...


The maze is invalid. However, the point of this puzzle is to find out that it is invalid, and a little something extra. I have made all the connections I can find.


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 ...


My Answer: Red lines are where you would go, yellow lines indicate moving over the fold.


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. GIF And the path in the format from-to (level). If the number includes a letter it comes from/goes to an internal ...


The way this maze works is: However, there is a catch: The path through the maze: The final answer:


The letter can escape by taking the following path:


If my Python programming is to be believed, the minimum number of moves required is 41:


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...


My path: Or, Explanation: Here I have highlighted the important walls in purple, splitting the maze into sections. Every area within a section can be reached from every other, and (obviously, since I highlighted walls) there are no ways to go from one section to another. Here I've cleaned up the maze, leaving just the important borders. (Yes, I manually ...


Solved Map: Individual Puzzles: As per @Henkie's post, the second door from EXAMPLE ROOM solved COLLISIONS solved REASSEMBLY solved GET TWO FREE solved MAZES IN MAZES solved HALF THE PICTURE solved MIND GAMES solved WHERE ARE YOU? solved ILL OMENS solved ACCOLADES solved BACKTRACKING solved GOAL IN SIGHT solved BLOCK CIPHER solved BLOCK ...


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 ...


Solution: 1. I started with the left room. The key for this room is Like so 2. Next note that Like so 3. Next note that Like so: 4. Then So we have 5. Now Like so 6. Almost finally... Like so 7. Finally 8. For completeness


Here is an answer that I think is slightly easier to understand:


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 ...


Final answer Continuing where Rand left off, we


Unless I'm missing something obvious... Just one!


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)


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 ...


Okay. THAT. WAS. INCREDIBLE! It took me two solid hours of work to solve and even longer to write and draw it all up here - hopefully it'll be worth it! To start us off, here is the final maze layout and routes: In the following explanation all colours have been abbreviated to their initials as follows: G=Green, O=Orange, P=Purple, Y=Yellow. An ...


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 ...


Given that (as shown in two other answers), there is no normal path, I extrapolate that this may be the solution to the maze.


Well, you beat me by 30 minutes, but I worked hard on this so I'm posting it anyway :)


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


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 ...


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).


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$ ...


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:

Only top voted, non community-wiki answers of a minimum length are eligible