Number of possible games of the Italian card game, "Scopa" ("Broom") So, there is this Italian card game called "Scopa" (broom) I used to play when I was a kid (still do sometimes), and I've been wondering how many possible games can be played.
I'll try to explain how the game is structured but not the exact rules since they're not important for the calculation (if you're interestend in the game here's the Wikipedia article).
The deck is made of $40$ cards and the game is played in 2. At the beginning, of the 40 cards, 4 are dealt on ground, and then 3 cards are dealt to each player.
At this point the players will each play one card at a time, until the cards in their hands end, and then they will be dealt 3 cards each again. This is repeat till the deck is empty.
What I've been thinking is:


*

*The number of ways the initial 4 cards can be dealt is $\binom{40}{4}$

*The number of ways the 3 cards can be dealt to the players is $\binom{36}{3}$ the first time cards are dealt, $\binom{33}{3}$ the second time, and so on...

*Each time a player receives the 3 cards, he has $3!$ ways of playing those cards.


Put all together, my estimates gives: $$\binom{40}{4}\cdot3!\cdot\prod_{i=1}^{12}\binom{i\cdot3}{3}\simeq9.37\cdot10^{37}$$
Is my reasoning correct?
 A: You made one mistake:  The $(3!)$ should be raised to the $12$ power, since each time a player has to play $3$ cards you get that factor.
But generally, your reasoning and method was right.
A: 
By far not a complete answer, but let me tell you a couple of facts that are explicative of the reason why the computation is quite hard.

First, if it were as simple as you put it, then you could just say that the number of games if $\binom{40}4\cdot 36!$. In fact, if a game (of people that do not use strategy) were completely determined by the initial cards on the field and the order in which each player plays his cards, then you could order the movers from first to thirty-sixth, notice that one player always plays the odd moves and the other one always plays the even moves, and claim that the number of games for each initial configuration is just $36!$. If you think about it, the fact that the moves are organised in rounds of six is irrelevant.
However, the fact is that the order in which the cards are played does not determine completely a game. Let's say the cards on the field are $\{2,3,4,5\}$ of some seeds, and you play a $7$. You can decide to capture either $\{2,5\}$, or $\{4,3\}$. An event like this duplicates the number of matches assigned to a specific order of moves.

"How can I know when a case like this happens?"

Well, that's why I'm outta here.
A: No, your $3!$ should be raised to the $12$th power because there were twelve times the order was invoked.  A simpler way to calculate it is to choose the first four cards in $40 \choose 4$ ways as you have done, then recognize that you can just put the remaining $36$ cards in the order they will be played in $36!$ ways, making $${40 \choose 4} \cdot 36! \approx 3.4\cdot 10^{46}$$ ways.  If you multiply your number by $6^{11}$ you get this one.
