Vjylku

Temporarily disable WLAN internet access for children, but allow it for adults

Calculating total slots

How are Fiends, Celestials, dragons, etc. affected by the Antimagic Field spell?

Invalid date error by date command

Store Credit Card Information in Password Manager?

Is aluminum electrical wire used on aircraft?

Is there a RAID 0 Equivalent for RAM?

Why is it that I can sometimes guess the next note?

Does Doodling or Improvising on the Piano Have Any Benefits?

Why would a new[] expression ever invoke a destructor?

How should I respond when I lied about my education and the company finds out through background check?

Has any country ever had 2 former presidents in jail simultaneously?

Multiplicative persistence

How does a computer interpret real numbers?

Why Shazam when there is already Superman?

What happens if you are holding an Iron Flask with a demon inside and walk into an Antimagic Field?

putting logo on same line but after title, latex

Can a Canadian Travel to the USA twice, less than 180 days each time?

How do you make your own symbol when Detexify fails?

Open a doc from terminal, but not by its name

What is the evidence for the "tyranny of the majority problem" in a direct democracy context?

Why does the Sun have different day lengths, but not the gas giants?

On a tidally locked planet, would time be quantized?

How to hide some fields of struct in C?

Keeping a ball lost forever

Four 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

2

$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

share|improve this question

asked 3 hours ago

ZanyGZanyG

1,086420

$endgroup$

add a comment | 

2

$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

share|improve this question

asked 3 hours ago

ZanyGZanyG

1,086420

$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

share|improve this question

asked 3 hours ago

ZanyGZanyG

1,086420

$endgroup$

share|improve this question

asked 3 hours ago

ZanyGZanyG

1,086420

share|improve this question

asked 3 hours ago

ZanyGZanyG

1,086420

asked 3 hours ago

ZanyGZanyG

1,086420

asked 3 hours ago

ZanyGZanyG

1,086420

1 Answer
1

active

oldest

votes

5

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

share|improve this answer

answered 3 hours ago

noednenoedne

7,16712057

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Very succinct; well done. I'll wait a bit before accepting.
  $endgroup$
  – ZanyG
  2 hours 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
});


}
});

draft saved

draft discarded

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

Name

Email

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

Name

Email

Required, but never shown

5

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

share|improve this answer

answered 3 hours ago

noednenoedne

7,16712057

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Very succinct; well done. I'll wait a bit before accepting.
  $endgroup$
  – ZanyG
  2 hours ago
  

  
  
  
  

add a comment | 

5

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

share|improve this answer

answered 3 hours ago

noednenoedne

7,16712057

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Very succinct; well done. I'll wait a bit before accepting.
  $endgroup$
  – ZanyG
  2 hours ago
  

  
  
  
  

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.

share|improve this answer

answered 3 hours ago

noednenoedne

7,16712057

$endgroup$

share|improve this answer

answered 3 hours ago

noednenoedne

7,16712057

answered 3 hours ago

noednenoedne

7,16712057

answered 3 hours ago

noednenoedne

7,16712057