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 is it that I can sometimes guess the next note?

Quoting Keynes in a lecture

How to hide some fields of struct in C?

What if a revenant (monster) gains fire resistance?

How can I cure my players of their suspicion that every object is a mimic?

Limits and Infinite Integration by Parts

Redundant comparison & "if" before assignment

Why can Carol Danvers change her suit colours in the first place?

Non-trope happy ending?

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

Recommended PCB layout understanding - ADM2572 datasheet

What exact color does ozone gas have?

Terse Method to Swap Lowest for Highest?

Why does AES have exactly 10 rounds for a 128-bit key, 12 for 192 bits and 14 for a 256-bit key size?

Can I still be respawned if I die by falling off the map?

How to explain what's wrong with this application of the chain rule?

Can disgust be a key component of horror?

Is there an injective, monotonically increasing, strictly concave function from the reals, to the reals?

What is Cash Advance APR?

Extract more than nine arguments that occur periodically in a sentence to use in macros in order to typset

How do you respond to a colleague from another team when they're wrongly expecting that you'll help them?

Calculate sum of polynomial roots

Quasinilpotent , non-compact operators

The IT department bottlenecks progress. How should I handle this?



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.



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$
















    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.



    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$














      2












      2








      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.



      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 2 hours ago









      ZanyGZanyG

      1,086420




      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









          $endgroup$












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









          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









          $endgroup$












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















          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









          $endgroup$












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













          5












          5








          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









          $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 2 hours ago









          noednenoedne

          7,16712057




          7,16712057











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
















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















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




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

          Disable / Remove link to Product Items in Cart Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How can I limit products that can be bought / added to cart?Remove item from cartHide “Add to Cart” button if specific products are already in cart“Prettifying” the custom options in cart pageCreate link in cart sidebar to view all added items After limit reachedLink products together in checkout/cartHow to Get product from cart and add it againHide action-edit on cart page if simple productRemoving Cart items - ObserverRemove wishlist items when added to cart

          Helsingin valtaus Sisällysluettelo Taustaa | Yleistä sotatoimista | Osapuolet | Taistelut Helsingin ympäristössä | Punaisten antautumissuunnitelma | Taistelujen kulku Helsingissä | Valtauksen jälkeen | Tappiot | Muistaminen | Kirjallisuutta | Lähteet | Aiheesta muualla | NavigointivalikkoTeoksen verkkoversioTeoksen verkkoversioGoogle BooksSisällissota Helsingissä päättyi tasan 95 vuotta sittenSaksalaisten ylivoima jyräsi punaisen HelsinginSuomalaiset kuvaavat sotien jälkiä kaupungeissa – katso kuvat ja tarinat tutuilta kulmiltaHelsingin valtaus 90 vuotta sittenSaksalaiset valtasivat HelsinginHyökkäys HelsinkiinHelsingin valtaus 12.–13.4. 1918Saksalaiset käyttivät ihmiskilpiä Helsingin valtauksessa 1918Teoksen verkkoversioTeoksen verkkoversioSaksalaiset hyökkäävät Etelä-SuomeenTaistelut LeppävaarassaSotilaat ja taistelutLeppävaara 1918 huhtikuussa. KapinatarinaHelsingin taistelut 1918Saksalaisten voitonparaati HelsingissäHelsingin valtausta juhlittiinSaksalaisten Helsinki vuonna 1918Helsingin taistelussa kaatuneet valkokaartilaisetHelsinkiin haudatut taisteluissa kaatuneet punaiset12.4.1918 Helsingin valtauksessa saksalaiset apujoukot vapauttavat kaupunginVapaussodan muistomerkkejä Helsingissä ja pääkaupunkiseudullaCrescendo / Vuoden 1918 Kansalaissodan uhrien muistomerkkim

          Adjektiivitarina Tarinan tekeminen | Esimerkki: ennen | Esimerkki: jälkeen | Navigointivalikko