DOI: 10.1007/s00182-014-0453-7. On the number of positions in chess without promotion

On the number of positions in chess without promotion

10.1007/s00182-014-0453-7

Crossref journal-article

Springer Science and Business Media LLC

International Journal of Game Theory (297)

Bibliography

Steinerberger, S. (2014). On the number of positions in chess without promotion. International Journal of Game Theory, 44(3), 761â767.

Authors 1

Stefan Steinerberger (first)

References 6 Referenced 14

Allis V (1994) Searching for solutions in games and artificial intelligence. Ph.D. Thesis, University of Limburg
Chinchalkar S (1996) An upper bound for the number of reachable positions. ICCA J 19(3):181–183 / ICCA J by S Chinchalkar (1996)
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
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 / Nature by J Schaeffer (2007)
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 / Heuristic programming in artificial intelligence 2: the second computer olympiad by J Schaeffer (1991)
Shannon C (1950) Programming a computer for playing chess, Philosophical Magazine 41 (10.1080/14786445008521796)

Dates

Type	When
Created	10 years, 9 months ago (Nov. 14, 2014, 10:50 a.m.)
Deposited	6 years, 3 months ago (May 23, 2019, 2:40 p.m.)
Indexed	11 months, 2 weeks ago (Sept. 15, 2024, 11:04 a.m.)
Issued	10 years, 9 months ago (Nov. 6, 2014)
Published	10 years, 9 months ago (Nov. 6, 2014)
Published Online	10 years, 9 months ago (Nov. 6, 2014)
Published Print	10 years, 1 month ago (Aug. 1, 2015)

Funders 0

None

BibTeX

@article{Steinerberger_2014, title={On the number of positions in chess without promotion}, volume={44}, ISSN={1432-1270}, url={http://dx.doi.org/10.1007/s00182-014-0453-7}, DOI={10.1007/s00182-014-0453-7}, number={3}, journal={International Journal of Game Theory}, publisher={Springer Science and Business Media LLC}, author={Steinerberger, Stefan}, year={2014}, month=nov, pages={761–767} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2024,
        9,
        15
      ]
    ],
    "date-time": "2024-09-15T15:04:52Z",
    "timestamp": 1726412692765
  },
  "reference-count": 6,
  "publisher": "Springer Science and Business Media LLC",
  "issue": "3",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            2014,
            11,
            6
          ]
        ],
        "date-time": "2014-11-06T00:00:00Z",
        "timestamp": 1415232000000
      },
      "content-version": "tdm",
      "delay-in-days": 0,
      "URL": "http://www.springer.com/tdm"
    }
  ],
  "content-domain": {
    "domain": [
      "link.springer.com"
    ],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        2015,
        8
      ]
    ]
  },
  "DOI": "10.1007/s00182-014-0453-7",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2014,
        11,
        14
      ]
    ],
    "date-time": "2014-11-14T15:50:58Z",
    "timestamp": 1415980258000
  },
  "page": "761-767",
  "update-policy": "http://dx.doi.org/10.1007/springer_crossmark_policy",
  "source": "Crossref",
  "is-referenced-by-count": 14,
  "title": "On the number of positions in chess without promotion",
  "prefix": "10.1007",
  "volume": "44",
  "author": [
    {
      "given": "Stefan",
      "family": "Steinerberger",
      "sequence": "first",
      "affiliation": []
    }
  ],
  "member": "297",
  "published-online": {
    "date-parts": [
      [
        2014,
        11,
        6
      ]
    ]
  },
  "reference": [
    {
      "key": "453_CR1",
      "unstructured": "Allis V (1994) Searching for solutions in games and artificial intelligence. Ph.D. Thesis, University of Limburg"
    },
    {
      "issue": "3",
      "key": "453_CR2",
      "first-page": "181",
      "volume": "19",
      "author": "S Chinchalkar",
      "year": "1996",
      "unstructured": "Chinchalkar S (1996) An upper bound for the number of reachable positions. ICCA J 19(3):181\u2013183",
      "journal-title": "ICCA J"
    },
    {
      "key": "453_CR3",
      "unstructured": "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\u2013297"
    },
    {
      "issue": "5844",
      "key": "453_CR4",
      "first-page": "1518",
      "volume": "317",
      "author": "J Schaeffer",
      "year": "2007",
      "unstructured": "Schaeffer J, Burch N, Bjrnsson Y, Kishimoto A, M\u00fcller M, Lake R, Lu P, Sutphen S (2007) Checkers is solved. Nature 317(5844):1518\u20131522",
      "journal-title": "Nature"
    },
    {
      "key": "453_CR5",
      "first-page": "119",
      "volume-title": "Heuristic programming in artificial intelligence 2: the second computer olympiad",
      "author": "J Schaeffer",
      "year": "1991",
      "unstructured": "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"
    },
    {
      "key": "453_CR6",
      "doi-asserted-by": "crossref",
      "unstructured": "Shannon C (1950) Programming a computer for playing chess, Philosophical Magazine 41",
      "DOI": "10.1080/14786445008521796"
    }
  ],
  "container-title": "International Journal of Game Theory",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/s00182-014-0453-7.pdf",
      "content-type": "application/pdf",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/article/10.1007/s00182-014-0453-7/fulltext.html",
      "content-type": "text/html",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/s00182-014-0453-7",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2019,
        5,
        23
      ]
    ],
    "date-time": "2019-05-23T18:40:53Z",
    "timestamp": 1558636853000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "http://link.springer.com/10.1007/s00182-014-0453-7"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        2014,
        11,
        6
      ]
    ]
  },
  "references-count": 6,
  "journal-issue": {
    "issue": "3",
    "published-print": {
      "date-parts": [
        [
          2015,
          8
        ]
      ]
    }
  },
  "alternative-id": [
    "453"
  ],
  "URL": "http://dx.doi.org/10.1007/s00182-014-0453-7",
  "relation": {},
  "ISSN": [
    "0020-7276",
    "1432-1270"
  ],
  "subject": [],
  "container-title-short": "Int J Game Theory",
  "published": {
    "date-parts": [
      [
        2014,
        11,
        6
      ]
    ]
  }
}