First of all, the crazyhouse board never has more than 32 pieces on it. so it will never get full.
For the finiteness of the number of games, the calculus is quite simple.
- There is a finite number of fields on a chess board.
- There is also a finite number of possible sets of figures (for each color). For example one of the players could have more than eight pawns on the board. But the number of combinations is finite.
- A game ends, if the game enters the same state for the third time.
even without all the other rules of chess it can be prooved that the number of crazyhouse games is finite. so we will forget about those for now.
Let us think of a move as the transition of one position on a chess board to another one. Of cause a move can also change the set of pieces on the board (capture).
To find all the possible positions on the board with any possible set of figures, we would sum up the number of possible positions for all the possible sets of figures. As both numbers are finite, the sum is a finite sum of finite elements and therefore finite.
this means there is a finite number of possible states of the game.
Now thnk of the longest possible game under these circumstances. it would iterate twice though every possible state. and then the next move will put the game into a state it already was in two times. this ends the game.
So, every chasyhouse game does end.
Also there are finitely many possibilities to arrange any subset of a finite set. See a math book for a proof. This means that you can only have a finite number of games with a finite number of moves.
Now your last question is actually the hardest one. I have no idea how this could even be calculated efficiently. You cannot just play all of them. even if we did it on all our computers no one of us would live long enough to see the result.
You would need some smart way of estimating this number. I have no idea how to do this. I would just like to add:
for the complexity of the game it might be much more interesting to know how many interesting games there are. Maybe this can be guessed somehow from the games that are already known (see the lichess database)
First of all, the crazyhouse board never has more than 32 pieces on it. so it will never get full.
For the finiteness of the number of games, the calculus is quite simple.
1) There is a finite number of fields on a chess board.
2) There is also a finite number of possible sets of figures (for each color). For example one of the players could have more than eight pawns on the board. But the number of combinations is finite.
3) A game ends, if the game enters the same state for the third time.
even without all the other rules of chess it can be prooved that the number of crazyhouse games is finite. so we will forget about those for now.
Let us think of a move as the transition of one position on a chess board to another one. Of cause a move can also change the set of pieces on the board (capture).
To find all the possible positions on the board with any possible set of figures, we would sum up the number of possible positions for all the possible sets of figures. As both numbers are finite, the sum is a finite sum of finite elements and therefore finite.
this means there is a finite number of possible states of the game.
Now thnk of the longest possible game under these circumstances. it would iterate twice though every possible state. and then the next move will put the game into a state it already was in two times. this ends the game.
So, every chasyhouse game does end.
Also there are finitely many possibilities to arrange any subset of a finite set. See a math book for a proof. This means that you can only have a finite number of games with a finite number of moves.
Now your last question is actually the hardest one. I have no idea how this could even be calculated efficiently. You cannot just play all of them. even if we did it on all our computers no one of us would live long enough to see the result.
You would need some smart way of estimating this number. I have no idea how to do this. I would just like to add:
for the complexity of the game it might be much more interesting to know how many interesting games there are. Maybe this can be guessed somehow from the games that are already known (see the lichess database)