Keeping a ball lost forever The 2019 Stack Overflow Developer Survey Results Are InFour stones on a Go-boardBlock the snake from reaching pointsNumber swapping gameLeast amount of moves is requiredHnefatafl - a lost ArtJonMark Perry's Grid Logic PuzzleGuide the dots to land on the portals at the same timeGuide dots to land on any pair of matching portals at the same time20 cards facing downThe No-Straight Maze
Does a dangling wire really electrocute me if I'm standing in water?
Where does the "burst of radiance" from Holy Weapon originate?
Can distinct morphisms between curves induce the same morphism on singular cohomology?
What do hard-Brexiteers want with respect to the Irish border?
JSON.serialize: is it possible to suppress null values of a map?
Why Did Howard Stark Use All The Vibranium They Had On A Prototype Shield?
What do the Banks children have against barley water?
How to change the limits of integration
How was Skylab's orbit inclination chosen?
How to create dashed lines/arrows in Illustrator
How to answer pointed "are you quitting" questioning when I don't want them to suspect
Is "plugging out" electronic devices an American expression?
Why isn't airport relocation done gradually?
Is there a name of the flying bionic bird?
In microwave frequencies, do you use a circulator when you need a (near) perfect diode?
Dual Citizen. Exited the US on Italian passport recently
Is this food a bread or a loaf?
Does it makes sense to buy a new cycle to learn riding?
Monty Hall variation
How long do I have to send payment?
Why is the maximum length of openwrt’s root password 8 characters?
How to reverse every other sublist of a list?
Is domain driven design an anti-SQL pattern?
Is it possible for the two major parties in the UK to form a coalition with each other instead of a much smaller party?
Keeping a ball lost forever
The 2019 Stack Overflow Developer Survey Results Are InFour stones on a Go-boardBlock the snake from reaching pointsNumber swapping gameLeast amount of moves is requiredHnefatafl - a lost ArtJonMark Perry's Grid Logic PuzzleGuide the dots to land on the portals at the same timeGuide dots to land on any pair of matching portals at the same time20 cards facing downThe No-Straight Maze
$begingroup$
Suppose you can make a rectangular maze, where each cell (apart from the bottom-right) can contain an arrow in one of the four directions (up, down, left or right) of your choosing, except for those on an edge or corner, which must not point out of the maze.
A ball is then placed into the top-left square and begins to move. It will move in the direction of the arrow in the cell that it is currently in. Then, that arrow will rotate 90 degrees clockwise. If an arrow is pointing out of the maze, it will continue rotating clockwise until it points in a valid direction.
A valid maze is one in which the ball will never reach the bottom-right corner.
Prove or disprove the existence of such a maze. If it exists, find the smallest possible maze (in terms of number of squares).
Here is an example of a maze.
- The ball begins in A1. It moves right to A2, and the A1 arrow rotates to point down.
- The ball moves left to A1, and the A2 arrow rotates to point down (as both up and right point out of the maze).
- The ball moves down to B1, and the A1 arrow rotates to point right (as both left and up point out of the maze).
- The ball moves up to A1, and the B1 arrow rotates to point right.
- The ball moves right to A2, and the A1 arrow rotates to point down.
- The ball moves down to B2, and the A2 arrow rotates to point left.
- Now, the ball is in B2, the bottom-right corner of the maze, so that is the end. It is not a valid maze, but if it were, it would have a score of $4$.
logical-deduction strategy optimization
asked Mar 22 at 21:39
ZanyGZanyG
1,153421
$endgroup$
add a comment |
$begingroup$
Suppose you can make a rectangular maze, where each cell (apart from the bottom-right) can contain an arrow in one of the four directions (up, down, left or right) of your choosing, except for those on an edge or corner, which must not point out of the maze.
A ball is then placed into the top-left square and begins to move. It will move in the direction of the arrow in the cell that it is currently in. Then, that arrow will rotate 90 degrees clockwise. If an arrow is pointing out of the maze, it will continue rotating clockwise until it points in a valid direction.
A valid maze is one in which the ball will never reach the bottom-right corner.
Prove or disprove the existence of such a maze. If it exists, find the smallest possible maze (in terms of number of squares).
Here is an example of a maze.
- The ball begins in A1. It moves right to A2, and the A1 arrow rotates to point down.
- The ball moves left to A1, and the A2 arrow rotates to point down (as both up and right point out of the maze).
- The ball moves down to B1, and the A1 arrow rotates to point right (as both left and up point out of the maze).
- The ball moves up to A1, and the B1 arrow rotates to point right.
- The ball moves right to A2, and the A1 arrow rotates to point down.
- The ball moves down to B2, and the A2 arrow rotates to point left.
- Now, the ball is in B2, the bottom-right corner of the maze, so that is the end. It is not a valid maze, but if it were, it would have a score of $4$.
logical-deduction strategy optimization
asked Mar 22 at 21:39
ZanyGZanyG
1,153421
$endgroup$
add a comment |
$begingroup$
Suppose you can make a rectangular maze, where each cell (apart from the bottom-right) can contain an arrow in one of the four directions (up, down, left or right) of your choosing, except for those on an edge or corner, which must not point out of the maze.
A ball is then placed into the top-left square and begins to move. It will move in the direction of the arrow in the cell that it is currently in. Then, that arrow will rotate 90 degrees clockwise. If an arrow is pointing out of the maze, it will continue rotating clockwise until it points in a valid direction.
A valid maze is one in which the ball will never reach the bottom-right corner.
Prove or disprove the existence of such a maze. If it exists, find the smallest possible maze (in terms of number of squares).
Here is an example of a maze.
- The ball begins in A1. It moves right to A2, and the A1 arrow rotates to point down.
- The ball moves left to A1, and the A2 arrow rotates to point down (as both up and right point out of the maze).
- The ball moves down to B1, and the A1 arrow rotates to point right (as both left and up point out of the maze).
- The ball moves up to A1, and the B1 arrow rotates to point right.
- The ball moves right to A2, and the A1 arrow rotates to point down.
- The ball moves down to B2, and the A2 arrow rotates to point left.
- Now, the ball is in B2, the bottom-right corner of the maze, so that is the end. It is not a valid maze, but if it were, it would have a score of $4$.
logical-deduction strategy optimization
asked Mar 22 at 21:39
ZanyGZanyG
1,153421
$endgroup$
Suppose you can make a rectangular maze, where each cell (apart from the bottom-right) can contain an arrow in one of the four directions (up, down, left or right) of your choosing, except for those on an edge or corner, which must not point out of the maze.
A ball is then placed into the top-left square and begins to move. It will move in the direction of the arrow in the cell that it is currently in. Then, that arrow will rotate 90 degrees clockwise. If an arrow is pointing out of the maze, it will continue rotating clockwise until it points in a valid direction.
A valid maze is one in which the ball will never reach the bottom-right corner.
Prove or disprove the existence of such a maze. If it exists, find the smallest possible maze (in terms of number of squares).
Here is an example of a maze.
- The ball begins in A1. It moves right to A2, and the A1 arrow rotates to point down.
- The ball moves left to A1, and the A2 arrow rotates to point down (as both up and right point out of the maze).
- The ball moves down to B1, and the A1 arrow rotates to point right (as both left and up point out of the maze).
- The ball moves up to A1, and the B1 arrow rotates to point right.
- The ball moves right to A2, and the A1 arrow rotates to point down.
- The ball moves down to B2, and the A2 arrow rotates to point left.
- Now, the ball is in B2, the bottom-right corner of the maze, so that is the end. It is not a valid maze, but if it were, it would have a score of $4$.
logical-deduction strategy optimization
logical-deduction strategy optimization
asked Mar 22 at 21:39
ZanyGZanyG
1,153421
asked Mar 22 at 21:39
ZanyGZanyG
1,153421
asked Mar 22 at 21:39
ZanyGZanyG
1,153421
asked Mar 22 at 21:39
ZanyGZanyG
1,153421
asked Mar 22 at 21:39
ZanyGZanyG
1,153421
1,153421
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Suppose such a maze exists. Then the balls visits at least one square infinitely many times. Let $S$ be one such square that is closest to the bottom-right. $S$ is not the bottom-right square, so there exists a square $T$ to the right of or below $S$ that is closer to the bottom-right than $S$ is. However, the ball must visit $T$ at least once every $4$ visits to $S$ due to arrow rotation. Therefore, the ball must also visit $T$ infinitely many times, contradicting the minimality of $S$. Then no such maze exists.
answered Mar 22 at 21:47
noednenoedne
9,02512466
$endgroup$
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
Mar 22 at 21:50
1
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
Mar 23 at 12:15
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%2f80948%2fkeeping-a-ball-lost-forever%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Suppose such a maze exists. Then the balls visits at least one square infinitely many times. Let $S$ be one such square that is closest to the bottom-right. $S$ is not the bottom-right square, so there exists a square $T$ to the right of or below $S$ that is closer to the bottom-right than $S$ is. However, the ball must visit $T$ at least once every $4$ visits to $S$ due to arrow rotation. Therefore, the ball must also visit $T$ infinitely many times, contradicting the minimality of $S$. Then no such maze exists.
answered Mar 22 at 21:47
noednenoedne
9,02512466
$endgroup$
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
Mar 22 at 21:50
1
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
Mar 23 at 12:15
add a comment |
$begingroup$
Suppose such a maze exists. Then the balls visits at least one square infinitely many times. Let $S$ be one such square that is closest to the bottom-right. $S$ is not the bottom-right square, so there exists a square $T$ to the right of or below $S$ that is closer to the bottom-right than $S$ is. However, the ball must visit $T$ at least once every $4$ visits to $S$ due to arrow rotation. Therefore, the ball must also visit $T$ infinitely many times, contradicting the minimality of $S$. Then no such maze exists.
answered Mar 22 at 21:47
noednenoedne
9,02512466
$endgroup$
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
Mar 22 at 21:50
1
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
Mar 23 at 12:15
add a comment |
$begingroup$
Suppose such a maze exists. Then the balls visits at least one square infinitely many times. Let $S$ be one such square that is closest to the bottom-right. $S$ is not the bottom-right square, so there exists a square $T$ to the right of or below $S$ that is closer to the bottom-right than $S$ is. However, the ball must visit $T$ at least once every $4$ visits to $S$ due to arrow rotation. Therefore, the ball must also visit $T$ infinitely many times, contradicting the minimality of $S$. Then no such maze exists.
answered Mar 22 at 21:47
noednenoedne
9,02512466
$endgroup$
Suppose such a maze exists. Then the balls visits at least one square infinitely many times. Let $S$ be one such square that is closest to the bottom-right. $S$ is not the bottom-right square, so there exists a square $T$ to the right of or below $S$ that is closer to the bottom-right than $S$ is. However, the ball must visit $T$ at least once every $4$ visits to $S$ due to arrow rotation. Therefore, the ball must also visit $T$ infinitely many times, contradicting the minimality of $S$. Then no such maze exists.
answered Mar 22 at 21:47
noednenoedne
9,02512466
answered Mar 22 at 21:47
noednenoedne
9,02512466
answered Mar 22 at 21:47
noednenoedne
9,02512466
answered Mar 22 at 21:47
noednenoedne
9,02512466
9,02512466
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
Mar 22 at 21:50
1
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
Mar 23 at 12:15
add a comment |
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
Mar 22 at 21:50
1
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
Mar 23 at 12:15
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
Mar 22 at 21:50
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
Mar 22 at 21:50
1
1
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
Mar 23 at 12:15
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
Mar 23 at 12:15
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%2f80948%2fkeeping-a-ball-lost-forever%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
