1. The problem statement, all variables and given/known data Given a standard chess board consisting of 64 squares with each game taking a total of 40 moves. Calculate the total number of games which can be played. You are to assume a stalemate situation occuring on the 40th move a completed game. 3. The attempt at a solution So there are 20 possible moves at the start of the game. 20 for white and 20 for black. There are a total of 400 possible games which consist of only 2 moves in total. This is as far as I got, I literally have no idea how to calculate this.