- finite number of pieces (eg. cards)
- finite number of actions each round
- clear endgame criteria
is computionally solvable. What comes with randomness is stochasticity, but if that made game unsolvable what about poker (solved for limit heads-up) and even scrabble?
Probably it's kind of semantic problem. I'm not complexity nor game theory expert.