How many possible openings are there in the game of chess, if we define an that opening consists of each player making their first 3 moves?

(With one move there are 400 possible openings)

(In reply to re: En passant? by friedlinguini)

I guess it does complicate the data structure phase of my algorithm.

To properly find this, we need to add a reference to previousGameState to each GameState after the initial one. While it's a minor data structures change, I suspect if would greatly complicate the part of the algorithm I chose not to address in any detail. Specifically "get a list of available moves".

Posted by levik on 2002-10-28 16:36:51