{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:51:07Z","timestamp":1742997067699,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876076"},{"type":"electronic","value":"9783540876083"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87608-3_19","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T11:35:11Z","timestamp":1222169711000},"page":"205-216","source":"Crossref","is-referenced-by-count":4,"title":["Extended Null-Move Reductions"],"prefix":"10.1007","author":[{"given":"Omid","family":"David-Tabibi","sequence":"first","affiliation":[]},{"given":"Nathan S.","family":"Netanyahu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","first-page":"466","volume-title":"Proceedings of the 5th Annual ACM Computer Science Conference","author":"S.G. Akl","year":"1977","unstructured":"Akl, S.G., Newborn, M.M.: The principal continuation and the killer heuristic. In: Proceedings of the 5th Annual ACM Computer Science Conference, pp. 466\u2013473. ACM Press, Seattle (1977)"},{"issue":"2","key":"19_CR2","first-page":"47","volume":"14","author":"T.S. Anantharaman","year":"1991","unstructured":"Anantharaman, T.S.: Extension heuristics. ICCA Journal\u00a014(2), 47\u201365 (1991)","journal-title":"ICCA Journal"},{"key":"19_CR3","first-page":"65","volume-title":"Advances in Computer Chess 5","author":"D.F. Beal","year":"1989","unstructured":"Beal, D.F.: Experiments with the null move. In: Beal, D.F. (ed.) Advances in Computer Chess 5, pp. 65\u201379. Elsevier Science Publishers, Amsterdam (1989)"},{"issue":"4","key":"19_CR4","first-page":"205","volume":"18","author":"D.F. Beal","year":"1995","unstructured":"Beal, D.F., Smith, M.C.: Quantification of search extension benefits. ICCA Journal\u00a018(4), 205\u2013218 (1995)","journal-title":"ICCA Journal"},{"key":"19_CR5","unstructured":"Berliner, H.J.: Chess as Problem Solving: The Development of a Tactics Analyzer. Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA (1974)"},{"key":"19_CR6","first-page":"89","volume-title":"Advances in Computer Chess 1","author":"J.A. Birmingham","year":"1977","unstructured":"Birmingham, J.A., Kent, P.: Tree-searching and tree-pruning techniques. In: Clarke, M.R.B. (ed.) Advances in Computer Chess 1, pp. 89\u2013107. Edinburgh University Press, Edinburgh (1977)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rnsson, Y., Marsland, T.: Multi-cut pruning in alpha-beta search. In: Proceedings of the 1st International Conference on Computers and Games, pp. 15\u201324 (1998)","DOI":"10.1007\/3-540-48957-6_2"},{"issue":"1-2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(00)00081-5","volume":"252","author":"Y. Bj\u00f6rnsson","year":"2001","unstructured":"Bj\u00f6rnsson, Y., Marsland, T.: Multi-cut alpha-beta-pruning in game-tree search. Theoretical Computer Science\u00a0252(1-2), 177\u2013196 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(83)90001-2","volume":"20","author":"M.S. Campbell","year":"1983","unstructured":"Campbell, M.S., Marsland, T.A.: A comparison of minimax tree search algorithms. Artificial Intelligence\u00a020(4), 347\u2013367 (1983)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"19_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.3233\/ICG-2002-25305","volume":"25","author":"O. David-Tabibi","year":"2002","unstructured":"David-Tabibi, O., Netanyahu, N.S.: Verified null-move pruning. ICGA Journal\u00a025(3), 153\u2013161 (2002)","journal-title":"ICGA Journal"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/11674399_13","volume-title":"Computers and Games","author":"O. David-Tabibi","year":"2006","unstructured":"David-Tabibi, O., Felner, A., Netanyahu, N.S.: Blockage detection in pawn endings. In: van den Herik, H.J., Bj\u00f6rnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol.\u00a03846, pp. 187\u2013201. Springer, Heidelberg (2006)"},{"key":"19_CR12","unstructured":"Diepeveen, V.: Private communication (2008)"},{"issue":"3","key":"19_CR13","first-page":"137","volume":"16","author":"C. Donninger","year":"1993","unstructured":"Donninger, C.: Null move and deep search: Selective search heuristics for obtuse chess programs. ICCA Journal\u00a016(3), 137\u2013143 (1993)","journal-title":"ICCA Journal"},{"issue":"3","key":"19_CR14","first-page":"155","volume":"22","author":"M. Feist","year":"1999","unstructured":"Feist, M.: The 9th World Computer-Chess Championship: Report on the tournament. ICCA Journal\u00a022(3), 155\u2013164 (1999)","journal-title":"ICCA Journal"},{"key":"19_CR15","unstructured":"Feldmann, R.: Fail high reductions. In: van den Herik, H.J., Uiterwijk, J.W.H.M. (eds.) Advances in Computer Chess 8, pp. 111\u2013128. Universiteit Maastricht (1996)"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-1-4613-9080-0_9","volume-title":"Computers, Chess, and Cognition","author":"G. Goetsch","year":"1990","unstructured":"Goetsch, G., Campbell, M.S.: Experiments with the null-move heuristic. In: Marsland, T.A., Schaeffer, J. (eds.) Computers, Chess, and Cognition, pp. 159\u2013168. Springer, New York (1990)"},{"issue":"1-3","key":"19_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0004-3702(72)90045-8","volume":"3","author":"J.J. Gillogly","year":"1972","unstructured":"Gillogly, J.J.: The technology chess program. Artificial Intelligence\u00a03(1-3), 145\u2013163 (1972)","journal-title":"Artificial Intelligence"},{"issue":"10","key":"19_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/2.625299","volume":"30","author":"S. Hammilton","year":"1997","unstructured":"Hammilton, S., Garber, L.: Deep Blue\u2019s hardware-software synergy. IEEE Computer\u00a030(10), 29\u201335 (1997)","journal-title":"IEEE Computer"},{"issue":"2","key":"19_CR19","first-page":"75","volume":"21","author":"E.A. Heinz","year":"1998","unstructured":"Heinz, E.A.: Extended futility pruning. ICCA Journal\u00a021(2), 75\u201383 (1998)","journal-title":"ICCA Journal"},{"issue":"3","key":"19_CR20","first-page":"123","volume":"22","author":"E.A. Heinz","year":"1999","unstructured":"Heinz, E.A.: Adaptive null-move pruning. ICCA Journal\u00a022(3), 123\u2013132 (1999)","journal-title":"ICCA Journal"},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/40.755469","volume":"19","author":"F.-h. Hsu","year":"1999","unstructured":"Hsu, F.-h.: IBM\u2019s DEEP BLUEchess grandmaster chips. IEEE Micro\u00a019(2), 70\u201380 (1999)","journal-title":"IEEE Micro"},{"issue":"1","key":"19_CR22","first-page":"3","volume":"8","author":"H.L. Nelson","year":"1985","unstructured":"Nelson, H.L.: Hash tables in CRAY BLITZ. ICCA Journal\u00a08(1), 3\u201313 (1985)","journal-title":"ICCA Journal"},{"key":"19_CR23","volume-title":"Computer Chess","author":"M.M. Newborn","year":"1975","unstructured":"Newborn, M.M.: Computer Chess. Academic Press, New York (1975)"},{"issue":"2","key":"19_CR24","first-page":"82","volume":"18","author":"S. Plenkner","year":"1995","unstructured":"Plenkner, S.: A null-move technique impervious to zugzwang. ICCA Journal\u00a018(2), 82\u201384 (1995)","journal-title":"ICCA Journal"},{"issue":"4","key":"19_CR25","first-page":"4","volume":"6","author":"A. Reinefeld","year":"1983","unstructured":"Reinefeld, A.: An improvement to the Scout tree-search algorithm. ICCA Journal\u00a06(4), 4\u201314 (1983)","journal-title":"ICCA Journal"},{"issue":"3","key":"19_CR26","first-page":"16","volume":"6","author":"J. Schaeffer","year":"1983","unstructured":"Schaeffer, J.: The history heuristic. ICCA Journal\u00a06(3), 16\u201319 (1983)","journal-title":"ICCA Journal"},{"key":"19_CR27","first-page":"255","volume-title":"Machine Intelligence 4","author":"J.J. Scott","year":"1969","unstructured":"Scott, J.J.: A chess-playing program. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence 4, pp. 255\u2013265. Edinburgh University Press, Edinburgh (1969)"},{"key":"19_CR28","volume-title":"Artificial Intelligence: The Heuristic Programming Approach","author":"J.R. Slagle","year":"1971","unstructured":"Slagle, J.R.: Artificial Intelligence: The Heuristic Programming Approach. McGraw-Hill, New York (1971)"},{"key":"19_CR29","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/978-1-4612-5515-4_4","volume-title":"Chess Skill in Man and Machine","author":"D.J. Slate","year":"1983","unstructured":"Slate, D.J., Atkin, L.R.: Chess 4.5 \u2013 The Northwestern University chess program. In: Frey, P.W. (ed.) Chess Skill in Man and Machine, 2nd edn., pp. 82\u2013118. Springer, New York (1983)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87608-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:50:45Z","timestamp":1715313045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87608-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876076","9783540876083"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87608-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}