{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:06Z","timestamp":1725564366591},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205456"},{"type":"electronic","value":"9783540400318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40031-8_9","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:50Z","timestamp":1283727830000},"page":"123-141","source":"Crossref","is-referenced-by-count":6,"title":["Selective Search in an Amazons Program"],"prefix":"10.1007","author":[{"given":"Henry","family":"Avetisyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard J.","family":"Lorentz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/40.755469","volume":"19","author":"F. Hsu","year":"1999","unstructured":"Hsu, F.: IBM\u2019s Deep Blue chess grandmaster chips. IEEE Micro.\u00a019, 70\u201381 (1999)","journal-title":"IEEE Micro."},{"key":"9_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2733-3","volume-title":"One Jump Ahead: Challenging Human Supremacy in Checkers","author":"J. Schaeffer","year":"1997","unstructured":"Schaeffer, J.: One Jump Ahead: Challenging Human Supremacy in Checkers. Springer, Heidelberg (1997)"},{"key":"9_CR3","first-page":"189","volume":"20","author":"M. Buro","year":"1997","unstructured":"Buro, M.: The Othello match of the year: Takeshi Murakami vs. Logistello. International Computer Chess Association Journal\u00a020, 189\u2013193 (1997)","journal-title":"International Computer Chess Association Journal"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-45579-5_27","volume-title":"Computers and Games","author":"M. M\u00fcller","year":"2002","unstructured":"M\u00fcller, M.: Review: Computer Go 1984-2000. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol.\u00a02063, pp. 405\u2013413. Springer, Heidelberg (2002)"},{"key":"9_CR5","first-page":"103","volume":"19","author":"H. Matsubara","year":"1996","unstructured":"Matsubara, H., Iida, H., Grimbergen, R.: Natural developments in game research: From chess to shogi to Go. International Computer Chess Association Journal\u00a019, 103\u2013112 (1996)","journal-title":"International Computer Chess Association Journal"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-45579-5_30","volume-title":"Computers and Games","author":"T. Takizawa","year":"2002","unstructured":"Takizawa, T., Grimbergen, R.: Review: Computer shogi through 2000. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol.\u00a02063, pp. 433\u2013442. Springer, Heidelberg (2002)"},{"key":"9_CR7","first-page":"243","volume-title":"More Games of No Chance","author":"M. M\u00fcller","year":"2001","unstructured":"M\u00fcller, M., Tegos, T.: Experiments in computer Amazons. In: Nowakowski, R. (ed.) More Games of No Chance, pp. 243\u2013260. Cambridge University Press, Cambridge (2001)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45579-5_17","volume-title":"Computers and Games","author":"M. Buro","year":"2002","unstructured":"Buro, M.: Simple Amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol.\u00a02063, pp. 250\u2013261. Springer, Heidelberg (2002)"},{"key":"9_CR9","unstructured":"Hensgens, P.: A knowledge-based approach of the game of Amazons. Master\u2019s thesis, Department of Informatics, Universiteit Maastrict (2001) Technical report CS 01-09"},{"key":"9_CR10","first-page":"4","volume":"6","author":"A. Reinfeld","year":"1983","unstructured":"Reinfeld, A.: An improvement to the Scout tree search algorithm. International Computer Chess Association Journal\u00a06, 4\u201314 (1983)","journal-title":"International Computer Chess Association Journal"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40031-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T02:03:53Z","timestamp":1553047433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40031-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205456","9783540400318"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40031-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}