Magic: The Gathering is Turing Complete
I'd claim strongly, that any game with:<p>- finite number of pieces (eg. cards)<p>- finite number of actions each round<p>- clear endgame criteria<p>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?<p>Probably it's kind of semantic problem. I'm not complexity nor game theory expert.