Keeping a ball lost foreverFour 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

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

Can a College of Swords bard use a Blade Flourish option on an opportunity attack provoked by their own Dissonant Whispers spell?

Does IPv6 have similar concept of network mask?

Mimic lecturing on blackboard, facing audience

Pre-mixing cryogenic fuels and using only one fuel tank

Did arcade monitors have same pixel aspect ratio as TV sets?

How can "mimic phobia" be cured or prevented?

Quoting Keynes in a lecture

Keeping a ball lost forever

Open a doc from terminal, but not by its name

How does the math work for Perception checks?

Does the Linux kernel need a file system to run?

putting logo on same line but after title, latex

What is going on with 'gets(stdin)' on the site coderbyte?

Why is the "ls" command showing permissions of files in a FAT32 partition?

Picking the different solutions to the time independent Schrodinger eqaution

Calculate sum of polynomial roots

On a tidally locked planet, would time be quantized?

How to rewrite equation of hyperbola in standard form

Terse Method to Swap Lowest for Highest?

Add big quotation marks inside my colorbox

Biological Blimps: Propulsion

Why is so much work done on numerical verification of the Riemann Hypothesis?

Lowest total scrabble score



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













4












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



An example of a 2x2 maze. Top-left (A1) has arrow pointing right, top-right (A2) is pointing left, lower-left (B1) is pointing up.



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









share|improve this question









$endgroup$
















    4












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



    An example of a 2x2 maze. Top-left (A1) has arrow pointing right, top-right (A2) is pointing left, lower-left (B1) is pointing up.



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









    share|improve this question









    $endgroup$














      4












      4








      4





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



      An example of a 2x2 maze. Top-left (A1) has arrow pointing right, top-right (A2) is pointing left, lower-left (B1) is pointing up.



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









      share|improve this question









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



      An example of a 2x2 maze. Top-left (A1) has arrow pointing right, top-right (A2) is pointing left, lower-left (B1) is pointing up.



      • 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













      share|improve this question











      share|improve this question




      share|improve this question










      asked 4 hours ago









      ZanyGZanyG

      1,096420




      1,096420




















          1 Answer
          1






          active

          oldest

          votes


















          7












          $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









          $endgroup$












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










          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


















          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









          7












          $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









          $endgroup$












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















          7












          $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









          $endgroup$












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













          7












          7








          7





          $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









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








          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 4 hours ago









          noednenoedne

          7,18712057




          7,18712057











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
















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















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




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

















          draft saved

          draft discarded
















































          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.




          draft saved


          draft discarded














          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





















































          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







          Popular posts from this blog

          Möglingen Índice Localización Historia Demografía Referencias Enlaces externos Menú de navegación48°53′18″N 9°07′45″E / 48.888333333333, 9.129166666666748°53′18″N 9°07′45″E / 48.888333333333, 9.1291666666667Sitio web oficial Mapa de Möglingen«Gemeinden in Deutschland nach Fläche, Bevölkerung und Postleitzahl am 30.09.2016»Möglingen

          Virtualbox - Configuration error: Querying “UUID” failed (VERR_CFGM_VALUE_NOT_FOUND)“VERR_SUPLIB_WORLD_WRITABLE” error when trying to installing OS in virtualboxVirtual Box Kernel errorFailed to open a seesion for the virtual machineFailed to open a session for the virtual machineUbuntu 14.04 LTS Virtualbox errorcan't use VM VirtualBoxusing virtualboxI can't run Linux-64 Bit on VirtualBoxUnable to insert the virtual optical disk (VBoxguestaddition) in virtual machine for ubuntu server in win 10VirtuaBox in Ubuntu 18.04 Issues with Win10.ISO Installation

          Torre de la Isleta Índice Véase también Referencias Bibliografía Enlaces externos Menú de navegación38°25′58″N 0°23′02″O / 38.43277778, -0.3838888938°25′58″N 0°23′02″O / 38.43277778, -0.38388889Torre de la Illeta de l’Horta o Torre Saleta. Base de datos de bienes inmuebles. Patrimonio Cultural. Secretaría de Estado de CulturaFicha BIC Torre de la Illeta de l’Horta. Dirección General de Patrimonio Cultural. Generalitat ValencianaLugares de interés. Ayuntamiento del CampelloTorre de la Isleta en CastillosNet.org