Editing Abstract strategy game (section)

== Comparison ==
Analysis of "pure" abstract strategy games is the subject of [[combinatorial game theory]]. Abstract strategy games with hidden information, bluffing, or simultaneous move elements are better served by Von Neumann–Morgenstern [[game theory]], while those with a component of luck may require [[probability theory]] incorporated into either of the above.

As for the qualitative aspects, ranking abstract strategy games according to their interest, complexity, or strategy levels is a daunting task and subject to extreme subjectivity. In terms of measuring how finite a mathematical field each of the three top contenders represents, it is estimated that checkers has a [[game-tree complexity]] of 10<sup>40</sup> possible games<!--<ref>Wikipedia,[[English draughts#Computer players]]</ref>-->, whereas chess has approximately 10<sup>123</sup><!--<ref>Wikipedia [[Computer Chess]]</ref>-->. As for Go, the possible legal game positions range in the magnitude of 10<sup>170</sup><!--<ref>Wikipedia, [[Go complexity]]</ref>-->.