Keeping a ball lost forever
$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 2 days ago
ZanyGZanyG
1,128421
$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 2 days ago
ZanyGZanyG
1,128421
$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 2 days ago
ZanyGZanyG
1,128421
$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 2 days ago
ZanyGZanyG
1,128421
asked 2 days ago
ZanyGZanyG
1,128421
asked 2 days ago
ZanyGZanyG
1,128421
asked 2 days ago
ZanyGZanyG
1,128421
asked 2 days ago
ZanyGZanyG
1,128421
1,128421
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 2 days ago
noednenoedne
7,52012159
$endgroup$
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
2 days ago
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
yesterday
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 2 days ago
noednenoedne
7,52012159
$endgroup$
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
2 days ago
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
yesterday
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 2 days ago
noednenoedne
7,52012159
$endgroup$
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
2 days ago
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
yesterday
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 2 days ago
noednenoedne
7,52012159
$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 2 days ago
noednenoedne
7,52012159
answered 2 days ago
noednenoedne
7,52012159
answered 2 days ago
noednenoedne
7,52012159
answered 2 days ago
noednenoedne
7,52012159
7,52012159
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
2 days ago
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
yesterday
add a comment |
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
2 days ago
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
yesterday
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
2 days ago
$begingroup$
Very succinct; well done. I'll wait a bit before accepting.
$endgroup$
– ZanyG
2 days ago
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
yesterday
$begingroup$
This(Q&A) probably belongs into mathematics.stackexchange.com ?
$endgroup$
– LMD
yesterday
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
