4-dimensional Knight's TourThe knight's gameLet's revisit this later (a two player knight's game)Knight's Tour QuestionClosed knight tour on 7x7 boardA Knight's KuromasuKnight's Tour on a cube surfaceA Pawn is riding this Knight on his TourKnight's Tour on a 7x7 Board starting from D5Four-dimensional light bulbs

Why my earth simulation is slower than the reality?

What are the pros and cons of Einstein-Cartan Theory?

Are there nouns that change meaning based on gender?

Why is Boris Johnson visiting only Paris & Berlin if every member of the EU needs to agree on a withdrawal deal?

How should I think about joining a company whose business I do not understand?

Ask for a paid taxi in order to arrive as early as possible for an interview within the city

Are required indicators necessary for radio buttons?

Is it safe to remove the bottom chords of a series of garage roof trusses?

Why doesn't the Falcon-9 first stage use three legs to land?

In an emergency, how do I find and share my position?

What is the difference between a premise and an assumption in logic?

Can my boyfriend, who lives in the UK and has a Polish passport, visit me in the USA?

How do you call it when two celestial bodies come as close to each other as they will in their current orbits?

!I!n!s!e!r!t! !n!b!e!t!w!e!e!n!

How does turbine efficiency compare with internal combustion engines if all the turbine power is converted to mechanical energy?

A second course in the representation theory

(Why) May a Beit Din refuse to bury a body in order to coerce a man into giving a divorce?

How to persuade recruiters to send me the Job Description?

Co-author responds to email by mistake cc'ing the EiC

Why are delta bots so finicky?

How to dismiss intrusive questions from a colleague with whom I don't work?

Should my "average" PC be able to discern the potential of encountering a gelatinous cube from subtle clues?

How can I run SQL Server Vulnerability Assessment from a SQL Job?

Is it insecure to have an ansible user with passwordless sudo?



4-dimensional Knight's Tour


The knight's gameLet's revisit this later (a two player knight's game)Knight's Tour QuestionClosed knight tour on 7x7 boardA Knight's KuromasuKnight's Tour on a cube surfaceA Pawn is riding this Knight on his TourKnight's Tour on a 7x7 Board starting from D5Four-dimensional light bulbs






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








11












$begingroup$


Imagine a 4-dimensional chess board, but with only 4 squares a side. So, $4times4times4times4=256$ sub-hypercubes.



Your mission - should you choose to accept - is to:




Find a Knight's Tour




Four dimensional spaces are actually quite easy to visualize:



4d Knight moves



The orange squares represent the possible destinations of a knight that starts from the red square - it moves $1$ in a dimension and $2$ in another.



If the coordinates of a knight are $(x,y,z,t)$, then we can get to $(xpm1,ypm2,z,t)$ or $(x,ypm1,z,tpm2)$, or any other combination, as long as we remain on the board.



The coordinates of the knight shows are $(1,1,1,1)$, with depth representing the $z$-axis, and the $t$-axis being represented by the multiple grid show left to right.



Therefore the first few coordinates of the orange squares, read left-right, top-bottom, are:




$(3,1,0,1), (1,1,0,3), (1,3,0,1), (3,0,1,1), (1,0,1,3), (3,1,1,0), dots$











share|improve this question











$endgroup$




















    11












    $begingroup$


    Imagine a 4-dimensional chess board, but with only 4 squares a side. So, $4times4times4times4=256$ sub-hypercubes.



    Your mission - should you choose to accept - is to:




    Find a Knight's Tour




    Four dimensional spaces are actually quite easy to visualize:



    4d Knight moves



    The orange squares represent the possible destinations of a knight that starts from the red square - it moves $1$ in a dimension and $2$ in another.



    If the coordinates of a knight are $(x,y,z,t)$, then we can get to $(xpm1,ypm2,z,t)$ or $(x,ypm1,z,tpm2)$, or any other combination, as long as we remain on the board.



    The coordinates of the knight shows are $(1,1,1,1)$, with depth representing the $z$-axis, and the $t$-axis being represented by the multiple grid show left to right.



    Therefore the first few coordinates of the orange squares, read left-right, top-bottom, are:




    $(3,1,0,1), (1,1,0,3), (1,3,0,1), (3,0,1,1), (1,0,1,3), (3,1,1,0), dots$











    share|improve this question











    $endgroup$
















      11












      11








      11


      1



      $begingroup$


      Imagine a 4-dimensional chess board, but with only 4 squares a side. So, $4times4times4times4=256$ sub-hypercubes.



      Your mission - should you choose to accept - is to:




      Find a Knight's Tour




      Four dimensional spaces are actually quite easy to visualize:



      4d Knight moves



      The orange squares represent the possible destinations of a knight that starts from the red square - it moves $1$ in a dimension and $2$ in another.



      If the coordinates of a knight are $(x,y,z,t)$, then we can get to $(xpm1,ypm2,z,t)$ or $(x,ypm1,z,tpm2)$, or any other combination, as long as we remain on the board.



      The coordinates of the knight shows are $(1,1,1,1)$, with depth representing the $z$-axis, and the $t$-axis being represented by the multiple grid show left to right.



      Therefore the first few coordinates of the orange squares, read left-right, top-bottom, are:




      $(3,1,0,1), (1,1,0,3), (1,3,0,1), (3,0,1,1), (1,0,1,3), (3,1,1,0), dots$











      share|improve this question











      $endgroup$




      Imagine a 4-dimensional chess board, but with only 4 squares a side. So, $4times4times4times4=256$ sub-hypercubes.



      Your mission - should you choose to accept - is to:




      Find a Knight's Tour




      Four dimensional spaces are actually quite easy to visualize:



      4d Knight moves



      The orange squares represent the possible destinations of a knight that starts from the red square - it moves $1$ in a dimension and $2$ in another.



      If the coordinates of a knight are $(x,y,z,t)$, then we can get to $(xpm1,ypm2,z,t)$ or $(x,ypm1,z,tpm2)$, or any other combination, as long as we remain on the board.



      The coordinates of the knight shows are $(1,1,1,1)$, with depth representing the $z$-axis, and the $t$-axis being represented by the multiple grid show left to right.



      Therefore the first few coordinates of the orange squares, read left-right, top-bottom, are:




      $(3,1,0,1), (1,1,0,3), (1,3,0,1), (3,0,1,1), (1,0,1,3), (3,1,1,0), dots$








      knight-moves four-dimensional






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited Aug 8 at 10:31







      JonMark Perry

















      asked Aug 8 at 10:24









      JonMark PerryJonMark Perry

      24.8k6 gold badges46 silver badges109 bronze badges




      24.8k6 gold badges46 silver badges109 bronze badges























          1 Answer
          1






          active

          oldest

          votes


















          10












          $begingroup$

          This puzzle can be broken down relatively easily.



          Start with




          A 3-dimensional 4x4x2. This can be done as follows:
          knights tour 1

          This is not as daunting as it looks. There are essentially just two patterns of four and we switch back and forth between them. The patterns are corner-middle-corner-middle, and side-side-side-side.


          Note that we're starting from a corner and ending adjacent to that corner. And, of course, that we can do that in reverse.




          So now we can put it together to finish the whole thing:




          Do the red ones first, then the orange and then repeat the whole process for each column (hyper-column?)
          knight tour 2

          Here I only show the first and last position of each 2x4x4 section. So we start at A and go to B, covering all the red squares. Then we jump to the next 2x4x4 section (B->C). Then we do C to D, covering all the orange squares. Similar logic takes us to E and the whole thing repeats.


          So the overall loop is A---B-C---D-E---F-G---H-A'---B'-C'---D'-E'---F'-G'---H', where the "-" is a direct jump, and the "---" is the move that covers the corresponding 2x4x4.







          share|improve this answer











          $endgroup$










          • 1




            $begingroup$
            And $H^'to A^''$ in the 5-th dimension, and so on... Well done!
            $endgroup$
            – JonMark Perry
            Aug 8 at 12:54














          Your Answer








          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%2f86960%2f4-dimensional-knights-tour%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









          10












          $begingroup$

          This puzzle can be broken down relatively easily.



          Start with




          A 3-dimensional 4x4x2. This can be done as follows:
          knights tour 1

          This is not as daunting as it looks. There are essentially just two patterns of four and we switch back and forth between them. The patterns are corner-middle-corner-middle, and side-side-side-side.


          Note that we're starting from a corner and ending adjacent to that corner. And, of course, that we can do that in reverse.




          So now we can put it together to finish the whole thing:




          Do the red ones first, then the orange and then repeat the whole process for each column (hyper-column?)
          knight tour 2

          Here I only show the first and last position of each 2x4x4 section. So we start at A and go to B, covering all the red squares. Then we jump to the next 2x4x4 section (B->C). Then we do C to D, covering all the orange squares. Similar logic takes us to E and the whole thing repeats.


          So the overall loop is A---B-C---D-E---F-G---H-A'---B'-C'---D'-E'---F'-G'---H', where the "-" is a direct jump, and the "---" is the move that covers the corresponding 2x4x4.







          share|improve this answer











          $endgroup$










          • 1




            $begingroup$
            And $H^'to A^''$ in the 5-th dimension, and so on... Well done!
            $endgroup$
            – JonMark Perry
            Aug 8 at 12:54
















          10












          $begingroup$

          This puzzle can be broken down relatively easily.



          Start with




          A 3-dimensional 4x4x2. This can be done as follows:
          knights tour 1

          This is not as daunting as it looks. There are essentially just two patterns of four and we switch back and forth between them. The patterns are corner-middle-corner-middle, and side-side-side-side.


          Note that we're starting from a corner and ending adjacent to that corner. And, of course, that we can do that in reverse.




          So now we can put it together to finish the whole thing:




          Do the red ones first, then the orange and then repeat the whole process for each column (hyper-column?)
          knight tour 2

          Here I only show the first and last position of each 2x4x4 section. So we start at A and go to B, covering all the red squares. Then we jump to the next 2x4x4 section (B->C). Then we do C to D, covering all the orange squares. Similar logic takes us to E and the whole thing repeats.


          So the overall loop is A---B-C---D-E---F-G---H-A'---B'-C'---D'-E'---F'-G'---H', where the "-" is a direct jump, and the "---" is the move that covers the corresponding 2x4x4.







          share|improve this answer











          $endgroup$










          • 1




            $begingroup$
            And $H^'to A^''$ in the 5-th dimension, and so on... Well done!
            $endgroup$
            – JonMark Perry
            Aug 8 at 12:54














          10












          10








          10





          $begingroup$

          This puzzle can be broken down relatively easily.



          Start with




          A 3-dimensional 4x4x2. This can be done as follows:
          knights tour 1

          This is not as daunting as it looks. There are essentially just two patterns of four and we switch back and forth between them. The patterns are corner-middle-corner-middle, and side-side-side-side.


          Note that we're starting from a corner and ending adjacent to that corner. And, of course, that we can do that in reverse.




          So now we can put it together to finish the whole thing:




          Do the red ones first, then the orange and then repeat the whole process for each column (hyper-column?)
          knight tour 2

          Here I only show the first and last position of each 2x4x4 section. So we start at A and go to B, covering all the red squares. Then we jump to the next 2x4x4 section (B->C). Then we do C to D, covering all the orange squares. Similar logic takes us to E and the whole thing repeats.


          So the overall loop is A---B-C---D-E---F-G---H-A'---B'-C'---D'-E'---F'-G'---H', where the "-" is a direct jump, and the "---" is the move that covers the corresponding 2x4x4.







          share|improve this answer











          $endgroup$



          This puzzle can be broken down relatively easily.



          Start with




          A 3-dimensional 4x4x2. This can be done as follows:
          knights tour 1

          This is not as daunting as it looks. There are essentially just two patterns of four and we switch back and forth between them. The patterns are corner-middle-corner-middle, and side-side-side-side.


          Note that we're starting from a corner and ending adjacent to that corner. And, of course, that we can do that in reverse.




          So now we can put it together to finish the whole thing:




          Do the red ones first, then the orange and then repeat the whole process for each column (hyper-column?)
          knight tour 2

          Here I only show the first and last position of each 2x4x4 section. So we start at A and go to B, covering all the red squares. Then we jump to the next 2x4x4 section (B->C). Then we do C to D, covering all the orange squares. Similar logic takes us to E and the whole thing repeats.


          So the overall loop is A---B-C---D-E---F-G---H-A'---B'-C'---D'-E'---F'-G'---H', where the "-" is a direct jump, and the "---" is the move that covers the corresponding 2x4x4.








          share|improve this answer














          share|improve this answer



          share|improve this answer








          edited Aug 8 at 12:35

























          answered Aug 8 at 12:29









          Dr XorileDr Xorile

          14.7k3 gold badges32 silver badges90 bronze badges




          14.7k3 gold badges32 silver badges90 bronze badges










          • 1




            $begingroup$
            And $H^'to A^''$ in the 5-th dimension, and so on... Well done!
            $endgroup$
            – JonMark Perry
            Aug 8 at 12:54













          • 1




            $begingroup$
            And $H^'to A^''$ in the 5-th dimension, and so on... Well done!
            $endgroup$
            – JonMark Perry
            Aug 8 at 12:54








          1




          1




          $begingroup$
          And $H^'to A^''$ in the 5-th dimension, and so on... Well done!
          $endgroup$
          – JonMark Perry
          Aug 8 at 12:54





          $begingroup$
          And $H^'to A^''$ in the 5-th dimension, and so on... Well done!
          $endgroup$
          – JonMark Perry
          Aug 8 at 12:54


















          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%2f86960%2f4-dimensional-knights-tour%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

          Category:9 (number) SubcategoriesMedia in category "9 (number)"Navigation menuUpload mediaGND ID: 4485639-8Library of Congress authority ID: sh85091979ReasonatorScholiaStatistics

          Circuit construction for execution of conditional statements using least significant bitHow are two different registers being used as “control”?How exactly is the stated composite state of the two registers being produced using the $R_zz$ controlled rotations?Efficiently performing controlled rotations in HHLWould this quantum algorithm implementation work?How to prepare a superposed states of odd integers from $1$ to $sqrtN$?Why is this implementation of the order finding algorithm not working?Circuit construction for Hamiltonian simulationHow can I invert the least significant bit of a certain term of a superposed state?Implementing an oracleImplementing a controlled sum operation

          Magento 2 “No Payment Methods” in Admin New OrderHow to integrate Paypal Express Checkout with the Magento APIMagento 1.5 - Sales > Order > edit order and shipping methods disappearAuto Invoice Check/Money Order Payment methodAdd more simple payment methods?Shipping methods not showingWhat should I do to change payment methods if changing the configuration has no effects?1.9 - No Payment Methods showing upMy Payment Methods not Showing for downloadable/virtual product when checkout?Magento2 API to access internal payment methodHow to call an existing payment methods in the registration form?