Answers.Body: <blockquote>
  <p>Is this possible when the lone knight starts only on certain squares ?</p>
  </blockquote>
  <p>If you stop and think about this for a second you will realize that the answer is obviously &quot;Yes&quot;. If you have a &quot;<a href="https://en.wikipedia.org/wiki/Knight%27s_tour" rel="nofollow noreferrer">Knight's Tour</a>&quot; (that's what it is called) starting on square X then by definition it also goes through square Y (for all squares Y on the chessboard). Hence the exact same moves, just starting on Y, will also be a Knight's Tour.</p>
  <blockquote>
  <p>How many unique solutions does this problem have</p>
  </blockquote>
  <p>According to <a href="https://en.wikipedia.org/wiki/Knight%27s_tour" rel="nofollow noreferrer">Wikipedia</a>:</p>
  <blockquote>
  <p>On an 8 × 8 board, there are exactly 26,534,728,821,064 directed closed tours (i.e. two tours along the same path that travel in opposite directions are counted separately, as are rotations and reflections). The number of undirected closed tours is half this number, since every tour can be traced in reverse.</p>
  </blockquote>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2021-07-02T15:30:09.393Z
Answers.Text: I don't follow. What do you mean "the exact same moves, just starting on Y".  Wouldn't that just be the same tour, but shifted to start at Y instead of X?  Which would be invalid as it would go off the board?  And to the second part: you quoted the number of closed tours, but the question seems to ask about open tours.
Answers.UserDisplayName: Kevin Wang
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2021-07-04T09:03:42.600Z
Answers.Text: @Kevin, imagine for simplicity we are talking a rook tour of a 2 x 2 board. This could be a1-a2-b2-b1-a1. Now, if we start at b2, we can just follow this path again b2-b1-a1; then pick up the start a1-a2-b2 and we're done
Answers.UserDisplayName: sjb
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2021-07-05T13:04:46.447Z
Answers.Text: @sjb again, that's only for closed tours, no?
Answers.UserDisplayName: Kevin Wang
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2021-07-02T11:23:47.860Z
Answers.LastActivityDate: 2021-07-02T11:29:28.843Z
Answers.LastEditDate: 2021-07-02T11:29:28.843Z
Answers.UserDisplayName: Brian Towers
Body: <p>It is well known that a lone knight can move all around the board covering each square once and only once. Is this possible when the lone knight starts only on certain squares ? How many unique solutions   does this problem have now that powerful engines exist?</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2021-07-02T14:49:45.683Z
Comments.Text: Does this answer your question? [How many different knight's tours are there?](https://chess.stackexchange.com/questions/24285/how-many-different-knights-tours-are-there)
Comments.UserDisplayName: L. Scott Johnson
Tags: <knights><mathematics><solving>
Title: Knight Moves Around the Board
ThreadText: # Knight Moves Around the Board
  
  (Asked by: username_0 on 2021-07-02)
  
  It is well known that a lone knight can move all around the board covering each square once and only once. Is this possible when the lone knight starts only on certain squares ? How many unique solutions does this problem have now that powerful engines exist?
  
  **Tags:** knights, mathematics, solving
  
  > **Comments:**
  > **username_1**: Does this answer your question? [How many different knight's tours are there?](https://chess.stackexchange.com/questions/24285/how-many-different-knights-tours-are-there)  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_2 on 2021-07-02. Score: 2
  
  > Is this possible when the lone knight starts only on certain squares ?
  
  If you stop and think about this for a second you will realize that the answer is obviously "Yes". If you have a "[Knight's Tour](https://en.wikipedia.org/wiki/Knight%27s_tour)" (that's what it is called) starting on square X then by definition it also goes through square Y (for all squares Y on the chessboard). Hence the exact same moves, just starting on Y, will also be a Knight's Tour.
  
  > How many unique solutions does this problem have
  
  According to [Wikipedia](https://en.wikipedia.org/wiki/Knight%27s_tour):
  
  > On an 8 × 8 board, there are exactly 26,534,728,821,064 directed closed tours (i.e. two tours along the same path that travel in opposite directions are counted separately, as are rotations and reflections). The number of undirected closed tours is half this number, since every tour can be traced in reverse.
  
  > **Comments:**
  > **username_3**: I don't follow. What do you mean "the exact same moves, just starting on Y".  Wouldn't that just be the same tour, but shifted to start at Y instead of X?  Which would be invalid as it would go off the board?  And to the second part: you quoted the number of closed tours, but the question seems to ask about open tours.  
  > **username_4**: @Kevin, imagine for simplicity we are talking a rook tour of a 2 x 2 board. This could be a1-a2-b2-b1-a1. Now, if we start at b2, we can just follow this path again b2-b1-a1; then pick up the start a1-a2-b2 and we're done  
  > **username_3**: @username_4 again, that's only for closed tours, no?  
  
  ---
  
  