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 31 possible positions, whereas chess has approximately 10 123 . This suggests that computer programs, through brute force calculation alone, should often be able to surpass human players' abilities. As for Go, the possible legal game positions range in the magnitude of 10 170 .
Term Name: memberOf URI: http:///dc/dcam/memberOf Label: Member Of Definition: A relationship between a resource and a vocabulary encoding scheme which indicates that the resource is a member of a set. See: http:///documents/2007/06/04/abstract-model/ Type of Term: Property Has Range: http:///dc/dcam/VocabularyEncodingScheme Version: http:///usage/terms/history/#memberOf-002 Term Name: VocabularyEncodingScheme URI: http:///dc/dcam/VocabularyEncodingScheme Label: Vocabulary Encoding Scheme Definition: An enumerated set of resources. See: http:///documents/2007/06/04/abstract-model/ Type of Term: Class Version: http:///usage/terms/history/#VocabularyEncodingScheme-001 Errata: - 2013-11-05. Updated reference to . - 2016-01-11. Updated reference to [DCMITYPE] /dcmi-type-vocabulary/dcmi-type-vocabulary\/#H7/.