Answers.Body: <p>Unless I misunderstand your question wouldn't that just be  (for every from square) the number of (to) squares that a knight can go to plus the number of squares that the queen can go to. As in the following diagrams which show to how many squares the respective piece can go.</p>
  
  <p><a href="https://i.sstatic.net/aCJr8.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/aCJr8.png" alt="knight"></a> <a href="https://i.sstatic.net/F9yvq.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/F9yvq.png" alt="queen"></a></p>
  
  <p>You'd just need to add the two numbers from the diagrams for every square. </p>
  
  <p>Depending on what you need all this for you might have to consider separately the special moves of castling, en passant and pawn promotion.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2017-03-06T02:54:27.110Z
Answers.LastActivityDate: 2019-09-21T18:06:54.633Z
Answers.LastEditDate: 2019-09-21T18:06:54.633Z
Answers.UserDisplayName: user1583209
Body: <p>Question is related to chess computing about <em>number of possible moves in chess</em>.</p>
  
  <p>I'm not talking about the number of possible positions but about <strong>the number of ways a piece can go from one square to any other.</strong></p>
  
  <p>Example 1:</p>
  
  <blockquote>
    <p>A piece can be on any one of the 64 squares and (approximately) it can go to any other. Thus, the number of possible moves are <code>64*64 = 4,096</code>. This is clearly an overestimate. In other words, <strong>what's the actual number of "from square" and "to square" combinations?</strong></p>
  </blockquote>
  
  <p>Example 2:</p>
  
  <blockquote>
    <p>For the square <code>a1</code>, there are 23 possible <em>from - to combinations</em>. Because a knight can go to two squares and a queen can go to twenty one squares (the other pieces don't add any).</p>
  </blockquote>
  
Tags: <pieces>
Title: The number of possible moves in Chess
ThreadText: # The number of possible moves in Chess
  
  (Asked by: username_0 on 2017-03-06)
  
  Question is related to chess computing about *number of possible moves in chess*.
  
  I'm not talking about the number of possible positions but about **the number of ways a piece can go from one square to any other.**
  
  Example 1:
  
  > A piece can be on any one of the 64 squares and (approximately) it can go to any other. Thus, the number of possible moves are `64*64 = 4,096`. This is clearly an overestimate. In other words, **what's the actual number of "from square" and "to square" combinations?**
  
  Example 2:
  
  > For the square `a1`, there are 23 possible *from - to combinations*. Because a knight can go to two squares and a queen can go to twenty one squares (the other pieces don't add any).
  
  **Tags:** pieces
  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_1 on 2017-03-06. Score: 4 | Accepted answer
  
  Unless I misunderstand your question wouldn't that just be (for every from square) the number of (to) squares that a knight can go to plus the number of squares that the queen can go to. As in the following diagrams which show to how many squares the respective piece can go.
  
  [![knight](https://i.sstatic.net/aCJr8.png)](https://i.sstatic.net/aCJr8.png) [![queen](https://i.sstatic.net/F9yvq.png)](https://i.sstatic.net/F9yvq.png)
  
  You'd just need to add the two numbers from the diagrams for every square.
  
  Depending on what you need all this for you might have to consider separately the special moves of castling, en passant and pawn promotion.
  
  
  ---
  
  