The No-Straight MazeThe Origins of a Confusing MazeEdward's Maze IA-maze-ing WordsearchAlice and the Fractal...
What's the oldest plausible frozen specimen for a Jurassic Park style story-line?
How much light is too much?
Can my friend and I spend the summer in Canada (6 weeks) at 16 years old without an adult?
Why is it that Bernie Sanders is always called a "socialist"?
Why didn't Tom Riddle take the presence of Fawkes and the Sorting Hat as more of a threat?
How can I prevent an oracle who can see into the past from knowing everything that has happened?
Charging phone battery with a lower voltage, coming from a bike charger?
Coworker asking me to not bring cakes due to self control issue. What should I do?
Boss asked me to sign a resignation paper without a date on it along with my new contract
What is a good reason for every spaceship to carry gun on board?
Sharepoint metadata URL
Am I correct in stating that the study of topology is purely theoretical?
Can a player sacrifice a creature after declaring that creature as blocker while taking lethal damage?
Word for something that's always reliable, but never the best?
Sitecore 9.1 Installation - Skip to particular step
Book where a space ship journeys to the center of the galaxy to find all the stars had gone supernova
Plausible reason for gold-digging ant
Why did Ylvis use "go" instead of "say" in phrases like "Dog goes 'woof'"?
Is the fingering of thirds flexible or do I have to follow the rules?
Prevent Nautilus / Nemo from creating .Trash-1000 folder in mounted devices
How vim overwrites readonly mode?
Are the positive and negative planes inner or outer planes in the Great Wheel cosmology model?
Reading Mishnayos without understanding
How do you funnel food off a cutting board?
The No-Straight Maze
The Origins of a Confusing MazeEdward's Maze IA-maze-ing WordsearchAlice and the Fractal Hedge MazeA-maze-ing TilesCryptic Clue MazeHelp me to find a small but hard and clever mazeCreate a changeable mazeNodes & TunnelsMore Nodes & Tunnels - The Tower
$begingroup$
Consider the following maze.
You can walk on the black lines, and your aim is to go from the green at the maze's bottom to the red on the left side. However, each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction, rather than continuing straight.
Find a valid path through the maze, or prove that no such solution exists.
- It's not a lateral-thinking puzzle; the solution is not a trick.
- If you arrive at a corner, simply follow the path.
- You cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
- It's a puzzle of my own creation, and I already have the solution.
- The missing line in the middle of the maze is intentional.
logical-deduction no-computers mazes
$endgroup$
add a comment |
$begingroup$
Consider the following maze.
You can walk on the black lines, and your aim is to go from the green at the maze's bottom to the red on the left side. However, each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction, rather than continuing straight.
Find a valid path through the maze, or prove that no such solution exists.
- It's not a lateral-thinking puzzle; the solution is not a trick.
- If you arrive at a corner, simply follow the path.
- You cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
- It's a puzzle of my own creation, and I already have the solution.
- The missing line in the middle of the maze is intentional.
logical-deduction no-computers mazes
$endgroup$
add a comment |
$begingroup$
Consider the following maze.
You can walk on the black lines, and your aim is to go from the green at the maze's bottom to the red on the left side. However, each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction, rather than continuing straight.
Find a valid path through the maze, or prove that no such solution exists.
- It's not a lateral-thinking puzzle; the solution is not a trick.
- If you arrive at a corner, simply follow the path.
- You cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
- It's a puzzle of my own creation, and I already have the solution.
- The missing line in the middle of the maze is intentional.
logical-deduction no-computers mazes
$endgroup$
Consider the following maze.
You can walk on the black lines, and your aim is to go from the green at the maze's bottom to the red on the left side. However, each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction, rather than continuing straight.
Find a valid path through the maze, or prove that no such solution exists.
- It's not a lateral-thinking puzzle; the solution is not a trick.
- If you arrive at a corner, simply follow the path.
- You cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
- It's a puzzle of my own creation, and I already have the solution.
- The missing line in the middle of the maze is intentional.
logical-deduction no-computers mazes
logical-deduction no-computers mazes
asked 10 hours ago
ZanyGZanyG
901319
901319
add a comment |
add a comment |
5 Answers
5
active
oldest
votes
$begingroup$
Since we must always turn 90 degrees, every odd-numbered step we take is always vertical and every even-numbered step is horizontal. Since the last step has to be horizontal, it means our total path has to be an even number of steps. In other words, once we've reached the red squares, we have made the same amount of vertical and horizontal steps.
After each odd-numbered vertical step, we are an odd number of rows away from the starting point. After each even-numbered step, we are an even number of rows away. The same applies for horizontal steps.
In the end, we have taken the same number of steps both horizontally and vertically (i.e. either both are even or both are odd). We are 4 columns away from the starting point, so we must have taken an even number of horizontal steps. However, we are 5 rows away from the starting point, so we must have taken an odd number of vertical steps. This is impossible, so we can conclude that there is no such path through the maze.
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...
...there actually is a solution (N, E, and then N-W until the end).
$endgroup$
add a comment |
$begingroup$
Here is an answer that I think is slightly easier to understand:
I have marked all the intersections with a white or a black dot in the manner of a checkerboard. Whatever path you travel, the intersections you visit will alternate black and white. Since you also have to alternate your direction of travel at every intersection between east/west and north/south, it is easy to see that when you arrive at any black intersection, your next move is east/west, and at a white intersection your next move is north/south. The only way to reach the red block is west from a white intersection, which you will therefore never be able to do.
To hammer the point home, from the restrictions above it follows that each edge can only be traversed in one direction. In the following picture I have marked each edge with the travel direction. As you can see, the edge to the red block has the arrow going in the wrong direction.
$endgroup$
add a comment |
$begingroup$
The path through the maze is:
non-existent.
Some notes about this -
The design of the maze is such that you'll basically be turning after following any line.
The missing segment is largely irrelevant.
Each step north, including the first, requires the next step to be east or west. Likewise for any step south.
You have to travel a net distance north of 5 steps.
After 1 step north + 1 step east/west, you're an ODD number of steps east or west of the starting position.
After two steps north + 1 east/west, you'll be an EVEN number of steps east or west of the start.
...
On a turn that leaves you 5 steps north, no matter how you get there, you'll be an even number of steps from the origin and about to have to turn east or west. The end state would require you to be an odd (3) number of steps west, so you will never be able to exit there.
$endgroup$
add a comment |
$begingroup$
It looks like this path may be successful:
Here's my reasoning:
Step 0 (Green Room) - START
Step 1 (N): I am now faced with a 3-way spoke, so I MUST turn 90°
Step 2 (W): I have chosen to travel in the 90° West direction along the edge of the maze, I can therefore continue straight at the next intersection (Only 2 spokes)
Step 3 (N): I am forced North by the corner of the maze and immediately am faced with another 3-way spoke.
Step 4 (W): I have chosen to travel in the 90° West direction along the edge of the maze.
Step 5 (N): I am forced North by the corner of the maze, but I see an intersection with 2 spokes, so I am able to continue straight on for two intersections until the next 3-spoke intersection.
Step 6 (W): I chose to go West by 90° once more and find myself in the Red Room!
Step 7 (Red Room) - END
New contributor
$endgroup$
2
$begingroup$
This violates the constraints of the puzzle: “each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction”. You reach several such intersections without turning.
$endgroup$
– doppelgreener
6 hours ago
$begingroup$
Now that I re-read, I think I see what you misinterpreted: you have decided to not count the path you came from as a spoke in the intersection. (You reason that the 2nd intersection you reach has “only 2 spokes”. This also explains why at step 3 you describe that four-spoke intersection as a “3-way spoke”.) However we have no reason to discount it this way: the spoke you're coming from is another spoke in the intersection.
$endgroup$
– doppelgreener
2 hours ago
$begingroup$
Aah, I see. I didn't know that counted because in my mind I discounted it because ofYou cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
$endgroup$
– Raisus
2 hours ago
$begingroup$
EDIT: There's no need to give it -ve response guys, that's just harsh!
$endgroup$
– Raisus
2 hours ago
$begingroup$
Invalid solutions are entirely eligible to get downvoted.
$endgroup$
– doppelgreener
2 hours ago
|
show 2 more comments
$begingroup$
This seems to work, don't know the math of odds evens up down but i ended up on the red.
New contributor
$endgroup$
$begingroup$
Sorry didn't turn at the first one but if you do it is actually easier
$endgroup$
– Josh Lewis
2 hours ago
$begingroup$
If you do turn at the first intersection (as you are supposed to), it won't be easier. It will be impossible, as the accepted answer shows. Are you sure you didn't go straight ahead at the last intersection?
$endgroup$
– Jaap Scherphuis
2 hours ago
1
$begingroup$
This makes an invalid move at the first intersection by not turning. Please update your answer to indicate a correct solution. If it is actually easier, it sounds like you already have a solution in mind: please post that.
$endgroup$
– doppelgreener
1 hour ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f79951%2fthe-no-straight-maze%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Since we must always turn 90 degrees, every odd-numbered step we take is always vertical and every even-numbered step is horizontal. Since the last step has to be horizontal, it means our total path has to be an even number of steps. In other words, once we've reached the red squares, we have made the same amount of vertical and horizontal steps.
After each odd-numbered vertical step, we are an odd number of rows away from the starting point. After each even-numbered step, we are an even number of rows away. The same applies for horizontal steps.
In the end, we have taken the same number of steps both horizontally and vertically (i.e. either both are even or both are odd). We are 4 columns away from the starting point, so we must have taken an even number of horizontal steps. However, we are 5 rows away from the starting point, so we must have taken an odd number of vertical steps. This is impossible, so we can conclude that there is no such path through the maze.
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...
...there actually is a solution (N, E, and then N-W until the end).
$endgroup$
add a comment |
$begingroup$
Since we must always turn 90 degrees, every odd-numbered step we take is always vertical and every even-numbered step is horizontal. Since the last step has to be horizontal, it means our total path has to be an even number of steps. In other words, once we've reached the red squares, we have made the same amount of vertical and horizontal steps.
After each odd-numbered vertical step, we are an odd number of rows away from the starting point. After each even-numbered step, we are an even number of rows away. The same applies for horizontal steps.
In the end, we have taken the same number of steps both horizontally and vertically (i.e. either both are even or both are odd). We are 4 columns away from the starting point, so we must have taken an even number of horizontal steps. However, we are 5 rows away from the starting point, so we must have taken an odd number of vertical steps. This is impossible, so we can conclude that there is no such path through the maze.
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...
...there actually is a solution (N, E, and then N-W until the end).
$endgroup$
add a comment |
$begingroup$
Since we must always turn 90 degrees, every odd-numbered step we take is always vertical and every even-numbered step is horizontal. Since the last step has to be horizontal, it means our total path has to be an even number of steps. In other words, once we've reached the red squares, we have made the same amount of vertical and horizontal steps.
After each odd-numbered vertical step, we are an odd number of rows away from the starting point. After each even-numbered step, we are an even number of rows away. The same applies for horizontal steps.
In the end, we have taken the same number of steps both horizontally and vertically (i.e. either both are even or both are odd). We are 4 columns away from the starting point, so we must have taken an even number of horizontal steps. However, we are 5 rows away from the starting point, so we must have taken an odd number of vertical steps. This is impossible, so we can conclude that there is no such path through the maze.
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...
...there actually is a solution (N, E, and then N-W until the end).
$endgroup$
Since we must always turn 90 degrees, every odd-numbered step we take is always vertical and every even-numbered step is horizontal. Since the last step has to be horizontal, it means our total path has to be an even number of steps. In other words, once we've reached the red squares, we have made the same amount of vertical and horizontal steps.
After each odd-numbered vertical step, we are an odd number of rows away from the starting point. After each even-numbered step, we are an even number of rows away. The same applies for horizontal steps.
In the end, we have taken the same number of steps both horizontally and vertically (i.e. either both are even or both are odd). We are 4 columns away from the starting point, so we must have taken an even number of horizontal steps. However, we are 5 rows away from the starting point, so we must have taken an odd number of vertical steps. This is impossible, so we can conclude that there is no such path through the maze.
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...
...there actually is a solution (N, E, and then N-W until the end).
edited 3 mins ago
answered 10 hours ago
jafejafe
21.2k459213
21.2k459213
add a comment |
add a comment |
$begingroup$
Here is an answer that I think is slightly easier to understand:
I have marked all the intersections with a white or a black dot in the manner of a checkerboard. Whatever path you travel, the intersections you visit will alternate black and white. Since you also have to alternate your direction of travel at every intersection between east/west and north/south, it is easy to see that when you arrive at any black intersection, your next move is east/west, and at a white intersection your next move is north/south. The only way to reach the red block is west from a white intersection, which you will therefore never be able to do.
To hammer the point home, from the restrictions above it follows that each edge can only be traversed in one direction. In the following picture I have marked each edge with the travel direction. As you can see, the edge to the red block has the arrow going in the wrong direction.
$endgroup$
add a comment |
$begingroup$
Here is an answer that I think is slightly easier to understand:
I have marked all the intersections with a white or a black dot in the manner of a checkerboard. Whatever path you travel, the intersections you visit will alternate black and white. Since you also have to alternate your direction of travel at every intersection between east/west and north/south, it is easy to see that when you arrive at any black intersection, your next move is east/west, and at a white intersection your next move is north/south. The only way to reach the red block is west from a white intersection, which you will therefore never be able to do.
To hammer the point home, from the restrictions above it follows that each edge can only be traversed in one direction. In the following picture I have marked each edge with the travel direction. As you can see, the edge to the red block has the arrow going in the wrong direction.
$endgroup$
add a comment |
$begingroup$
Here is an answer that I think is slightly easier to understand:
I have marked all the intersections with a white or a black dot in the manner of a checkerboard. Whatever path you travel, the intersections you visit will alternate black and white. Since you also have to alternate your direction of travel at every intersection between east/west and north/south, it is easy to see that when you arrive at any black intersection, your next move is east/west, and at a white intersection your next move is north/south. The only way to reach the red block is west from a white intersection, which you will therefore never be able to do.
To hammer the point home, from the restrictions above it follows that each edge can only be traversed in one direction. In the following picture I have marked each edge with the travel direction. As you can see, the edge to the red block has the arrow going in the wrong direction.
$endgroup$
Here is an answer that I think is slightly easier to understand:
I have marked all the intersections with a white or a black dot in the manner of a checkerboard. Whatever path you travel, the intersections you visit will alternate black and white. Since you also have to alternate your direction of travel at every intersection between east/west and north/south, it is easy to see that when you arrive at any black intersection, your next move is east/west, and at a white intersection your next move is north/south. The only way to reach the red block is west from a white intersection, which you will therefore never be able to do.
To hammer the point home, from the restrictions above it follows that each edge can only be traversed in one direction. In the following picture I have marked each edge with the travel direction. As you can see, the edge to the red block has the arrow going in the wrong direction.
edited 44 mins ago
answered 1 hour ago
Jaap ScherphuisJaap Scherphuis
15.6k12669
15.6k12669
add a comment |
add a comment |
$begingroup$
The path through the maze is:
non-existent.
Some notes about this -
The design of the maze is such that you'll basically be turning after following any line.
The missing segment is largely irrelevant.
Each step north, including the first, requires the next step to be east or west. Likewise for any step south.
You have to travel a net distance north of 5 steps.
After 1 step north + 1 step east/west, you're an ODD number of steps east or west of the starting position.
After two steps north + 1 east/west, you'll be an EVEN number of steps east or west of the start.
...
On a turn that leaves you 5 steps north, no matter how you get there, you'll be an even number of steps from the origin and about to have to turn east or west. The end state would require you to be an odd (3) number of steps west, so you will never be able to exit there.
$endgroup$
add a comment |
$begingroup$
The path through the maze is:
non-existent.
Some notes about this -
The design of the maze is such that you'll basically be turning after following any line.
The missing segment is largely irrelevant.
Each step north, including the first, requires the next step to be east or west. Likewise for any step south.
You have to travel a net distance north of 5 steps.
After 1 step north + 1 step east/west, you're an ODD number of steps east or west of the starting position.
After two steps north + 1 east/west, you'll be an EVEN number of steps east or west of the start.
...
On a turn that leaves you 5 steps north, no matter how you get there, you'll be an even number of steps from the origin and about to have to turn east or west. The end state would require you to be an odd (3) number of steps west, so you will never be able to exit there.
$endgroup$
add a comment |
$begingroup$
The path through the maze is:
non-existent.
Some notes about this -
The design of the maze is such that you'll basically be turning after following any line.
The missing segment is largely irrelevant.
Each step north, including the first, requires the next step to be east or west. Likewise for any step south.
You have to travel a net distance north of 5 steps.
After 1 step north + 1 step east/west, you're an ODD number of steps east or west of the starting position.
After two steps north + 1 east/west, you'll be an EVEN number of steps east or west of the start.
...
On a turn that leaves you 5 steps north, no matter how you get there, you'll be an even number of steps from the origin and about to have to turn east or west. The end state would require you to be an odd (3) number of steps west, so you will never be able to exit there.
$endgroup$
The path through the maze is:
non-existent.
Some notes about this -
The design of the maze is such that you'll basically be turning after following any line.
The missing segment is largely irrelevant.
Each step north, including the first, requires the next step to be east or west. Likewise for any step south.
You have to travel a net distance north of 5 steps.
After 1 step north + 1 step east/west, you're an ODD number of steps east or west of the starting position.
After two steps north + 1 east/west, you'll be an EVEN number of steps east or west of the start.
...
On a turn that leaves you 5 steps north, no matter how you get there, you'll be an even number of steps from the origin and about to have to turn east or west. The end state would require you to be an odd (3) number of steps west, so you will never be able to exit there.
answered 10 hours ago
Rubio♦Rubio
28.9k565178
28.9k565178
add a comment |
add a comment |
$begingroup$
It looks like this path may be successful:
Here's my reasoning:
Step 0 (Green Room) - START
Step 1 (N): I am now faced with a 3-way spoke, so I MUST turn 90°
Step 2 (W): I have chosen to travel in the 90° West direction along the edge of the maze, I can therefore continue straight at the next intersection (Only 2 spokes)
Step 3 (N): I am forced North by the corner of the maze and immediately am faced with another 3-way spoke.
Step 4 (W): I have chosen to travel in the 90° West direction along the edge of the maze.
Step 5 (N): I am forced North by the corner of the maze, but I see an intersection with 2 spokes, so I am able to continue straight on for two intersections until the next 3-spoke intersection.
Step 6 (W): I chose to go West by 90° once more and find myself in the Red Room!
Step 7 (Red Room) - END
New contributor
$endgroup$
2
$begingroup$
This violates the constraints of the puzzle: “each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction”. You reach several such intersections without turning.
$endgroup$
– doppelgreener
6 hours ago
$begingroup$
Now that I re-read, I think I see what you misinterpreted: you have decided to not count the path you came from as a spoke in the intersection. (You reason that the 2nd intersection you reach has “only 2 spokes”. This also explains why at step 3 you describe that four-spoke intersection as a “3-way spoke”.) However we have no reason to discount it this way: the spoke you're coming from is another spoke in the intersection.
$endgroup$
– doppelgreener
2 hours ago
$begingroup$
Aah, I see. I didn't know that counted because in my mind I discounted it because ofYou cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
$endgroup$
– Raisus
2 hours ago
$begingroup$
EDIT: There's no need to give it -ve response guys, that's just harsh!
$endgroup$
– Raisus
2 hours ago
$begingroup$
Invalid solutions are entirely eligible to get downvoted.
$endgroup$
– doppelgreener
2 hours ago
|
show 2 more comments
$begingroup$
It looks like this path may be successful:
Here's my reasoning:
Step 0 (Green Room) - START
Step 1 (N): I am now faced with a 3-way spoke, so I MUST turn 90°
Step 2 (W): I have chosen to travel in the 90° West direction along the edge of the maze, I can therefore continue straight at the next intersection (Only 2 spokes)
Step 3 (N): I am forced North by the corner of the maze and immediately am faced with another 3-way spoke.
Step 4 (W): I have chosen to travel in the 90° West direction along the edge of the maze.
Step 5 (N): I am forced North by the corner of the maze, but I see an intersection with 2 spokes, so I am able to continue straight on for two intersections until the next 3-spoke intersection.
Step 6 (W): I chose to go West by 90° once more and find myself in the Red Room!
Step 7 (Red Room) - END
New contributor
$endgroup$
2
$begingroup$
This violates the constraints of the puzzle: “each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction”. You reach several such intersections without turning.
$endgroup$
– doppelgreener
6 hours ago
$begingroup$
Now that I re-read, I think I see what you misinterpreted: you have decided to not count the path you came from as a spoke in the intersection. (You reason that the 2nd intersection you reach has “only 2 spokes”. This also explains why at step 3 you describe that four-spoke intersection as a “3-way spoke”.) However we have no reason to discount it this way: the spoke you're coming from is another spoke in the intersection.
$endgroup$
– doppelgreener
2 hours ago
$begingroup$
Aah, I see. I didn't know that counted because in my mind I discounted it because ofYou cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
$endgroup$
– Raisus
2 hours ago
$begingroup$
EDIT: There's no need to give it -ve response guys, that's just harsh!
$endgroup$
– Raisus
2 hours ago
$begingroup$
Invalid solutions are entirely eligible to get downvoted.
$endgroup$
– doppelgreener
2 hours ago
|
show 2 more comments
$begingroup$
It looks like this path may be successful:
Here's my reasoning:
Step 0 (Green Room) - START
Step 1 (N): I am now faced with a 3-way spoke, so I MUST turn 90°
Step 2 (W): I have chosen to travel in the 90° West direction along the edge of the maze, I can therefore continue straight at the next intersection (Only 2 spokes)
Step 3 (N): I am forced North by the corner of the maze and immediately am faced with another 3-way spoke.
Step 4 (W): I have chosen to travel in the 90° West direction along the edge of the maze.
Step 5 (N): I am forced North by the corner of the maze, but I see an intersection with 2 spokes, so I am able to continue straight on for two intersections until the next 3-spoke intersection.
Step 6 (W): I chose to go West by 90° once more and find myself in the Red Room!
Step 7 (Red Room) - END
New contributor
$endgroup$
It looks like this path may be successful:
Here's my reasoning:
Step 0 (Green Room) - START
Step 1 (N): I am now faced with a 3-way spoke, so I MUST turn 90°
Step 2 (W): I have chosen to travel in the 90° West direction along the edge of the maze, I can therefore continue straight at the next intersection (Only 2 spokes)
Step 3 (N): I am forced North by the corner of the maze and immediately am faced with another 3-way spoke.
Step 4 (W): I have chosen to travel in the 90° West direction along the edge of the maze.
Step 5 (N): I am forced North by the corner of the maze, but I see an intersection with 2 spokes, so I am able to continue straight on for two intersections until the next 3-spoke intersection.
Step 6 (W): I chose to go West by 90° once more and find myself in the Red Room!
Step 7 (Red Room) - END
New contributor
New contributor
answered 6 hours ago
RaisusRaisus
952
952
New contributor
New contributor
2
$begingroup$
This violates the constraints of the puzzle: “each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction”. You reach several such intersections without turning.
$endgroup$
– doppelgreener
6 hours ago
$begingroup$
Now that I re-read, I think I see what you misinterpreted: you have decided to not count the path you came from as a spoke in the intersection. (You reason that the 2nd intersection you reach has “only 2 spokes”. This also explains why at step 3 you describe that four-spoke intersection as a “3-way spoke”.) However we have no reason to discount it this way: the spoke you're coming from is another spoke in the intersection.
$endgroup$
– doppelgreener
2 hours ago
$begingroup$
Aah, I see. I didn't know that counted because in my mind I discounted it because ofYou cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
$endgroup$
– Raisus
2 hours ago
$begingroup$
EDIT: There's no need to give it -ve response guys, that's just harsh!
$endgroup$
– Raisus
2 hours ago
$begingroup$
Invalid solutions are entirely eligible to get downvoted.
$endgroup$
– doppelgreener
2 hours ago
|
show 2 more comments
2
$begingroup$
This violates the constraints of the puzzle: “each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction”. You reach several such intersections without turning.
$endgroup$
– doppelgreener
6 hours ago
$begingroup$
Now that I re-read, I think I see what you misinterpreted: you have decided to not count the path you came from as a spoke in the intersection. (You reason that the 2nd intersection you reach has “only 2 spokes”. This also explains why at step 3 you describe that four-spoke intersection as a “3-way spoke”.) However we have no reason to discount it this way: the spoke you're coming from is another spoke in the intersection.
$endgroup$
– doppelgreener
2 hours ago
$begingroup$
Aah, I see. I didn't know that counted because in my mind I discounted it because ofYou cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
$endgroup$
– Raisus
2 hours ago
$begingroup$
EDIT: There's no need to give it -ve response guys, that's just harsh!
$endgroup$
– Raisus
2 hours ago
$begingroup$
Invalid solutions are entirely eligible to get downvoted.
$endgroup$
– doppelgreener
2 hours ago
2
2
$begingroup$
This violates the constraints of the puzzle: “each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction”. You reach several such intersections without turning.
$endgroup$
– doppelgreener
6 hours ago
$begingroup$
This violates the constraints of the puzzle: “each time you reach an intersection of three or more black paths (spokes), you must turn 90 degrees either direction”. You reach several such intersections without turning.
$endgroup$
– doppelgreener
6 hours ago
$begingroup$
Now that I re-read, I think I see what you misinterpreted: you have decided to not count the path you came from as a spoke in the intersection. (You reason that the 2nd intersection you reach has “only 2 spokes”. This also explains why at step 3 you describe that four-spoke intersection as a “3-way spoke”.) However we have no reason to discount it this way: the spoke you're coming from is another spoke in the intersection.
$endgroup$
– doppelgreener
2 hours ago
$begingroup$
Now that I re-read, I think I see what you misinterpreted: you have decided to not count the path you came from as a spoke in the intersection. (You reason that the 2nd intersection you reach has “only 2 spokes”. This also explains why at step 3 you describe that four-spoke intersection as a “3-way spoke”.) However we have no reason to discount it this way: the spoke you're coming from is another spoke in the intersection.
$endgroup$
– doppelgreener
2 hours ago
$begingroup$
Aah, I see. I didn't know that counted because in my mind I discounted it because of
You cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
$endgroup$
– Raisus
2 hours ago
$begingroup$
Aah, I see. I didn't know that counted because in my mind I discounted it because of
You cannot suddenly turn around and walk the other way, but you may retrace your steps otherwise.
$endgroup$
– Raisus
2 hours ago
$begingroup$
EDIT: There's no need to give it -ve response guys, that's just harsh!
$endgroup$
– Raisus
2 hours ago
$begingroup$
EDIT: There's no need to give it -ve response guys, that's just harsh!
$endgroup$
– Raisus
2 hours ago
$begingroup$
Invalid solutions are entirely eligible to get downvoted.
$endgroup$
– doppelgreener
2 hours ago
$begingroup$
Invalid solutions are entirely eligible to get downvoted.
$endgroup$
– doppelgreener
2 hours ago
|
show 2 more comments
$begingroup$
This seems to work, don't know the math of odds evens up down but i ended up on the red.
New contributor
$endgroup$
$begingroup$
Sorry didn't turn at the first one but if you do it is actually easier
$endgroup$
– Josh Lewis
2 hours ago
$begingroup$
If you do turn at the first intersection (as you are supposed to), it won't be easier. It will be impossible, as the accepted answer shows. Are you sure you didn't go straight ahead at the last intersection?
$endgroup$
– Jaap Scherphuis
2 hours ago
1
$begingroup$
This makes an invalid move at the first intersection by not turning. Please update your answer to indicate a correct solution. If it is actually easier, it sounds like you already have a solution in mind: please post that.
$endgroup$
– doppelgreener
1 hour ago
add a comment |
$begingroup$
This seems to work, don't know the math of odds evens up down but i ended up on the red.
New contributor
$endgroup$
$begingroup$
Sorry didn't turn at the first one but if you do it is actually easier
$endgroup$
– Josh Lewis
2 hours ago
$begingroup$
If you do turn at the first intersection (as you are supposed to), it won't be easier. It will be impossible, as the accepted answer shows. Are you sure you didn't go straight ahead at the last intersection?
$endgroup$
– Jaap Scherphuis
2 hours ago
1
$begingroup$
This makes an invalid move at the first intersection by not turning. Please update your answer to indicate a correct solution. If it is actually easier, it sounds like you already have a solution in mind: please post that.
$endgroup$
– doppelgreener
1 hour ago
add a comment |
$begingroup$
This seems to work, don't know the math of odds evens up down but i ended up on the red.
New contributor
$endgroup$
This seems to work, don't know the math of odds evens up down but i ended up on the red.
New contributor
New contributor
answered 2 hours ago
Josh LewisJosh Lewis
1
1
New contributor
New contributor
$begingroup$
Sorry didn't turn at the first one but if you do it is actually easier
$endgroup$
– Josh Lewis
2 hours ago
$begingroup$
If you do turn at the first intersection (as you are supposed to), it won't be easier. It will be impossible, as the accepted answer shows. Are you sure you didn't go straight ahead at the last intersection?
$endgroup$
– Jaap Scherphuis
2 hours ago
1
$begingroup$
This makes an invalid move at the first intersection by not turning. Please update your answer to indicate a correct solution. If it is actually easier, it sounds like you already have a solution in mind: please post that.
$endgroup$
– doppelgreener
1 hour ago
add a comment |
$begingroup$
Sorry didn't turn at the first one but if you do it is actually easier
$endgroup$
– Josh Lewis
2 hours ago
$begingroup$
If you do turn at the first intersection (as you are supposed to), it won't be easier. It will be impossible, as the accepted answer shows. Are you sure you didn't go straight ahead at the last intersection?
$endgroup$
– Jaap Scherphuis
2 hours ago
1
$begingroup$
This makes an invalid move at the first intersection by not turning. Please update your answer to indicate a correct solution. If it is actually easier, it sounds like you already have a solution in mind: please post that.
$endgroup$
– doppelgreener
1 hour ago
$begingroup$
Sorry didn't turn at the first one but if you do it is actually easier
$endgroup$
– Josh Lewis
2 hours ago
$begingroup$
Sorry didn't turn at the first one but if you do it is actually easier
$endgroup$
– Josh Lewis
2 hours ago
$begingroup$
If you do turn at the first intersection (as you are supposed to), it won't be easier. It will be impossible, as the accepted answer shows. Are you sure you didn't go straight ahead at the last intersection?
$endgroup$
– Jaap Scherphuis
2 hours ago
$begingroup$
If you do turn at the first intersection (as you are supposed to), it won't be easier. It will be impossible, as the accepted answer shows. Are you sure you didn't go straight ahead at the last intersection?
$endgroup$
– Jaap Scherphuis
2 hours ago
1
1
$begingroup$
This makes an invalid move at the first intersection by not turning. Please update your answer to indicate a correct solution. If it is actually easier, it sounds like you already have a solution in mind: please post that.
$endgroup$
– doppelgreener
1 hour ago
$begingroup$
This makes an invalid move at the first intersection by not turning. Please update your answer to indicate a correct solution. If it is actually easier, it sounds like you already have a solution in mind: please post that.
$endgroup$
– doppelgreener
1 hour ago
add a comment |
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f79951%2fthe-no-straight-maze%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown