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 possible positions, whereas chess has approximately 10.