{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:32:43Z","timestamp":1743125563406,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319919072"},{"type":"electronic","value":"9783319919089"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-91908-9_12","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T09:05:00Z","timestamp":1570179900000},"page":"200-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rating Computer Science via Chess"],"prefix":"10.1007","author":[{"given":"Kenneth W.","family":"Regan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,5]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C Shannon","year":"1950","unstructured":"Shannon, C.: Programming a computer for playing chess. Philos. Mag. 41, 256\u2013275 (1950)","journal-title":"Philos. Mag."},{"key":"12_CR2","first-page":"633","volume":"59","author":"A Turing","year":"1950","unstructured":"Turing, A.: Computing machinery and intelligence. Mind 59, 633\u2013660 (1950)","journal-title":"Mind"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-1-4613-9080-0_1","volume-title":"Computers, Chess, and Cognition","author":"T. A. Marsland","year":"1990","unstructured":"Marsland, T.A.: A short history of computer chess. In: Marsland, T.A., Schaeffer, J. (eds.) Computers, Chess, and Cognition, pp. 3\u20137. Springer, New York (1990). https:\/\/doi.org\/10.1007\/978-1-4613-9080-0_1"},{"key":"12_CR4","unstructured":"Campbell, M., Feigenbaum, E., Levy, D., McCarthy, J., Newborn, M.: The History of Computer Chess: An AI Perspective (2005). http:\/\/www.computerhistory.org\/collections\/catalog\/102651382 . Video, The Computer History Museum"},{"key":"12_CR5","unstructured":"Larson, E.: A brief history of computer chess. Best Sch. Mag. (2015)"},{"key":"12_CR6","first-page":"723","volume":"28","author":"D Levy","year":"1973","unstructured":"Levy, D.: Computer chess-past, present and future. Chess Life Rev. 28, 723\u2013726 (1973)","journal-title":"Chess Life Rev."},{"key":"12_CR7","volume-title":"The Rating of Chessplayers, Past and Present","author":"A Elo","year":"1978","unstructured":"Elo, A.: The Rating of Chessplayers, Past and Present. Arco Pub., New York (1978)"},{"key":"12_CR8","unstructured":"Silver, N.: Introducing Elo Ratings (2014). https:\/\/fivethirtyeight.com\/datalab\/introducing-nfl-elo-ratings\/"},{"key":"12_CR9","first-page":"377","volume":"48","author":"ME Glickman","year":"1999","unstructured":"Glickman, M.E.: Parameter estimation in large dynamic paired comparison experiments. Appl. Stat. 48, 377\u2013394 (1999)","journal-title":"Appl. Stat."},{"key":"12_CR10","unstructured":"Sonas, J., Kaggle.com: Chess ratings: Elo versus the Rest of the World (2011). http:\/\/www.kaggle.com\/c\/chess"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1144079","volume":"317","author":"J Schaeffer","year":"2007","unstructured":"Schaeffer, J., Burch, N., Bj\u00f6rnsson, Y., Kishimoto, A., M\u00fcller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science 317, 1518\u20131522 (2007)","journal-title":"Science"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-50062-1_6","volume-title":"Computability and Complexity","author":"E Allender","year":"2017","unstructured":"Allender, E.: The complexity of complexity. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 79\u201394. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50062-1_6"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0022-0000(83)90030-2","volume":"27","author":"J Storer","year":"1983","unstructured":"Storer, J.: On the complexity of chess. J. Comput. Syst. Sci. 27, 77\u2013100 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","volume":"31","author":"A Fraenkel","year":"1981","unstructured":"Fraenkel, A., Lichtenstein, D.: Computing a perfect strategy for n x n chess requires time exponential in n. J. Comb. Theory 31, 199\u2013214 (1981)","journal-title":"J. Comb. Theory"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"D Lichtenstein","year":"1980","unstructured":"Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. J. ACM 27, 393\u2013401 (1980)","journal-title":"J. ACM"},{"key":"12_CR16","unstructured":"Robson, J.: The complexity of Go. In: Proceedings of the IFIP Congress, pp. 413\u2013417 (1983)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/0213018","volume":"3","author":"J Robson","year":"1984","unstructured":"Robson, J.: N by N checkers is Exptime complete. SIAM J. Comput. 3, 252\u2013267 (1984)","journal-title":"SIAM J. Comput."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90131-7","volume":"123","author":"S Iwata","year":"1994","unstructured":"Iwata, S., Kasai, T.: The Othello game on an n*n board is PSPACE-complete. Theoret. Comput. Sci. 123, 329\u2013340 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR19","unstructured":"Zakharov, V., Makhnychev, V.: Creating tables of chess 7-piece endgames on the Lomonosov supercomputer. Superkomp\u2019yutery 15 (2013)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1090\/S0025-5718-97-00856-9","volume":"66","author":"D Bailey","year":"1997","unstructured":"Bailey, D., Borwein, P., Plouffe, S.: On the rapid computation of various polylogarithmic constants. Math. Comput. 66, 903\u2013913 (1997)","journal-title":"Math. Comput."},{"key":"12_CR21","volume-title":"Artificial Intelligence in the 21st Century","author":"S Lucci","year":"2013","unstructured":"Lucci, S., Kopec, D.: Artificial Intelligence in the 21st Century. Mercury Learning, Dulles (2013)"},{"key":"12_CR22","unstructured":"Chess Programming Wiki: Parallel Search. chessprogramming.wikispaces.com\/Parallel+Search . Accessed 2017"},{"key":"12_CR23","first-page":"213","volume":"22","author":"R Hyatt","year":"1999","unstructured":"Hyatt, R.: Rotated bitmaps, a new twist on an old idea. ICCA J. 22, 213\u2013222 (1999)","journal-title":"ICCA J."},{"key":"12_CR24","unstructured":"IBM Research: How Deep Blue works (1997). https:\/\/www.research.ibm.com\/deepblue\/meet\/html\/d.3.2.html"},{"key":"12_CR25","unstructured":"Chess Programming Wiki: Automated Tuning. https:\/\/chessprogramming.wikispaces.com\/Automated+Tuning . Accessed 2017"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3233\/ICG-2005-28302","volume":"28","author":"R Hyatt","year":"2005","unstructured":"Hyatt, R., Cozzie, A.: The effect of hash signature collisions in a computer chess program. ICGA J. 28, 131\u2013139 (2005)","journal-title":"ICGA J."},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(90)90073-9","volume":"43","author":"T Anantharaman","year":"1990","unstructured":"Anantharaman, T., Campbell, M., Hsu, F.: Singular extensions: adding selectivity to brute-force searching. Artif. Intell. 43, 99\u2013110 (1990)","journal-title":"Artif. Intell."},{"key":"12_CR28","unstructured":"Hsu, F.H.: Behind Deep Blue: Building the Computer that Defeated the World Chess Champion. Princeton University Press, Princeton (2002)"},{"key":"12_CR29","unstructured":"Silver, A.: Komodo 8: the smartphone vs desktop challenge (2014). https:\/\/en.chessbase.com\/post\/komodo-8-the-smartphone-vs-desktop-challenge"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","volume":"12","author":"H Berliner","year":"1979","unstructured":"Berliner, H.: The B* tree search algorithm: a best-first proof procedure. Artif. Intell. 12, 23\u201340 (1979)","journal-title":"Artif. Intell."},{"key":"12_CR31","unstructured":"ChessBase: Big 2017 Chess Database (2017)"},{"key":"12_CR32","unstructured":"Ban, A.: Automatic learning of evaluation, with applications to computer chess. Technical Report Discussion Paper 613, Center for the Study of Rationality, Hebrew University (2012)"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Thompson, K.: Computer chess strength. In: Advances in Computer Chess, vol. 3, pp. 55\u201356. Pergamon Press (1982)","DOI":"10.1016\/B978-0-08-026898-9.50008-5"},{"key":"12_CR34","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-1-4612-5515-4_9","volume-title":"Chess Skill in Man and Machine","author":"J. H. Condon","year":"1983","unstructured":"Condon, J., Thompson, K.: Belle. In: Frey, P. (ed.) Chess Skill in Man and Machine, pp. 201\u2013210. Springer, Heidelberg (1982). https:\/\/www.springer.com\/us\/book\/9780387908151"},{"issue":"1","key":"12_CR35","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0004-3702(90)90067-A","volume":"43","author":"H Berliner","year":"1990","unstructured":"Berliner, H., Geotsch, G., Campbell, M., Ebeling, C.: Measuring the performance potential of chess programs. Artif. Intell. 43(1), 7\u201320 (1990)","journal-title":"Artif. Intell."},{"key":"12_CR36","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1038\/scientificamerican1090-44","volume":"263","author":"FH Hsu","year":"1990","unstructured":"Hsu, F.H., Anantharaman, T., Campbell, M., Nowatzyk, A.: A grandmaster chess machine. Sci. Am. 263, 44\u201350 (1990)","journal-title":"Sci. Am."},{"key":"12_CR37","unstructured":"Top Chess Engine Championship: Ratings after Season 9 - Superfinal. http:\/\/tcec.chessdom.com\/archive.php . Accessed 2017"},{"key":"12_CR38","unstructured":"Moravec, H.: When will computer hardware match the human brain? J. Evol. Technol. 1 (1998)"},{"key":"12_CR39","unstructured":"Bratko, I., Kopec, D.: A test for comparison of human and computer performance in chess. In: Advances in Computer Chess, vol. 3, pp. 31\u201356. Elsevier (1982)"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Kopec, D., Bratko, I.: The Bratko-Kopec experiment: a comparison of human and computer performance in chess. In: Advances in Computer Chess, vol. 3, pp. 57\u201372. Elsevier (1982)","DOI":"10.1016\/B978-0-08-026898-9.50009-7"},{"key":"12_CR41","first-page":"15","volume":"13","author":"T Marsland","year":"1990","unstructured":"Marsland, T.: The Bratko-Kopec test revisited. ICCA J. 13, 15\u201319 (1990)","journal-title":"ICCA J."},{"key":"12_CR42","doi-asserted-by":"publisher","first-page":"81","DOI":"10.3233\/ICG-2003-26204","volume":"26","author":"G Haworth","year":"2003","unstructured":"Haworth, G.: Reference fallible endgame play. ICGA J. 26, 81\u201391 (2003)","journal-title":"ICGA J."},{"key":"12_CR43","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3233\/ICG-2006-29203","volume":"29","author":"M Guid","year":"2006","unstructured":"Guid, M., Bratko, I.: Computer analysis of world chess champions. ICGA J. 29, 65\u201373 (2006)","journal-title":"ICGA J."},{"key":"12_CR44","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3233\/ICG-2011-34204","volume":"34","author":"M Guid","year":"2011","unstructured":"Guid, M., Bratko, I.: Using heuristic-search based engines for estimating human skill at chess. ICGA J. 34, 71\u201381 (2011)","journal-title":"ICGA J."},{"key":"12_CR45","unstructured":"Rajlich, V., Kaufman, L.: Rybka 3 chess engine (2008). www.rybkachess.com"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"DiFatta, G., Haworth, G., Regan, K.: Skill rating by Bayesian inference. In: Proceedings of 2009 IEEE Symposium on Computational Intelligence and Data Mining (CIDM 2009), Nashville, TN, pp. 89\u201394 (2009)","DOI":"10.1109\/CIDM.2009.4938634"},{"key":"12_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-12993-3_10","volume-title":"Advances in Computer Games","author":"G Haworth","year":"2010","unstructured":"Haworth, G., Regan, K., Di Fatta, G.: Performance and prediction: Bayesian modelling of fallible choice in chess. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 99\u2013110. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12993-3_10"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"Regan, K., Haworth, G.: Intrinsic chess ratings. In: Proceedings of AAAI 2011, San Francisco, pp. 834\u2013839 (2011)","DOI":"10.1609\/aaai.v25i1.7951"},{"key":"12_CR49","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3233\/ICG-2008-31302","volume":"31","author":"M Guid","year":"2008","unstructured":"Guid, M., P\u00e9rez, A., Bratko, I.: How trustworthy is Crafty\u2019s analysis of world chess champions? ICGA J. 31, 131\u2013144 (2008)","journal-title":"ICGA J."},{"key":"12_CR50","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of Go with deep neural networks and tree search. Nature 529, 484\u2013489 (2016)","journal-title":"Nature"},{"key":"12_CR51","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1207\/s15516709cog2704_3","volume":"27","author":"C Chabris","year":"2003","unstructured":"Chabris, C., Hearst, E.: Visualization, pattern recognition, and forward search: effects of playing speed and sight of the position on grandmaster chess errors. Cogn. Sci. 27, 637\u2013648 (2003)","journal-title":"Cogn. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Software Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91908-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:20:47Z","timestamp":1664583647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91908-9_12"}},"subtitle":["In Memoriam Daniel Kopec and Hans Berliner"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783319919072","9783319919089"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91908-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}