1

I have calculated an upper bound and modified a calculation of a lower bound for a similar game. I assume the real size is closer to the upper bound. $$ 7.36 \cdot 10^{27} \leq |SPADES| \leq 3.09 \cdot 10^{72} $$ Upper bound The State-space complexity of Spades can be computed by counting for each possible starting state (deal), all the possible sequences ...


Only top voted, non community-wiki answers of a minimum length are eligible