Originally posted by RabbitColdThe math side of it does not take into account the possibility of moving back and forth, The number of moves is significant even by the 4th move.
No you can totally move forever...
1. f3 f6
2. Kf2 2. Kf7
Then just keep moving the kings around. I think you could go on forever if you like. Just would be rather pointless.
Originally posted by smw6869Who cares?
So, anyone know the mathematical algorithm for figuring this out. I bet that guy on the TV show 'Numbers" would know.
I'll give you the formula.
You pick up pawn ya? and pushe forward 2 squares non?
Seriously though, on whites first move, there are 20 different moves, black has the same 20 different moves, thus after 1 move, you could have 400 different positions.
Now it just grows from there because your other pieces can start moving also once the pawns have moved forward.
Read this if you want:
http://mathworld.wolfram.com/Chess.html
4 edits
Originally posted by lauseyThat is not true. Knowing the cardinality of the set of feasible solutions for an optimization problem in no way entails knowledge of the optimal solution.
If it were possible to calculate exactly how many combinations, then it will be possible to "solve" chess completely.
3 edits
Taking the 50 move rule into account: Before 50 moves a piece have to be captured or a pawn moved. You have 8 pawns each - each pawn can only be moved 6 times and then promotes. For each move of a pawn you could have 16 * 6 * 50 = 4800 moves (50 move rule after each pawn move). After this you are left with 15 pieces each (all pawns promoted). Now a piece has to be captured every 50 moves or a draw occurs. 30 * 50 = 1500. Leaving the 2 kings - Add another 100 (50 moves each).
My calculation gives about 6400 moves.
Funny enough 64 squares multiplied by 100!
