On the number of positions in chess without promotion

International Journal of Game Theory

Volumn 44, Issue 3, 2015, Pages 761-767

  Steinerberger, Stefan ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Chess; Shannon s number; State space

Indexed keywords

EID: 84938285042     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00182-014-0453-7     Document Type: Article

References (6)

1. Allis V (1994) Searching for solutions in games and artificial intelligence. Ph.D. Thesis, University of Limburg
2. Chinchalkar S (1996) An upper bound for the number of reachable positions. ICCA J 19(3):181–183
3. Schaeffer J, Bjornsson Y, Burch N, Kishimoto A, Muller M, Lake R, Lu P, Sutphen S (2005) Solving checkers. In: International joint conference on artificial intelligence (IJCAI), pp. 292–297
4. Schaeffer J, Burch N, Bjrnsson Y, Kishimoto A, Müller M, Lake R, Lu P, Sutphen S (2007) Checkers is solved. Nature 317(5844):1518–1522
5. Schaeffer J, Culberson J, Treloa N, Knight B, Lu P, Szafron D (1991) Reviving the game of checkers. In: Levy DNL, Beal DF (eds) Heuristic programming in artificial intelligence 2: the second computer olympiad. Ellis Horwood Ltd., Chichester, p 119
6. Shannon C (1950) Programming a computer for playing chess, Philosophical Magazine 41