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.
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?
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).