{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:25:33Z","timestamp":1725474333890},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318658"},{"type":"electronic","value":"9783642318665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31866-5_26","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T21:51:08Z","timestamp":1342648268000},"page":"306-319","source":"Crossref","is-referenced-by-count":1,"title":["Game Tree Search with Adaptive Resolution"],"prefix":"10.1007","author":[{"given":"Hung-Jui","family":"Chang","sequence":"first","affiliation":[]},{"given":"Meng-Tsung","family":"Tsai","sequence":"additional","affiliation":[]},{"given":"Tsan-sheng","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Adelson-Velskiy, G.M., Arlazarov, V.L., Donskoy, M.V.: Some methods of controlling the tree search in chess programs, pp. 129\u2013135. Springer-Verlag New York, Inc., New York (1988)","DOI":"10.1007\/978-1-4757-1968-0_14"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Akl, S.G., Newborn, M.M.: The principal continuation and the killer heuristic, pp. 466\u2013473 (1977)","DOI":"10.1145\/800179.810240"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Atkin, L., Slate, D.: Chess 4.5-The Northwestern University chess program, pp. 80\u2013103. Springer-Verlag New York, Inc., New York (1988)","DOI":"10.1007\/978-1-4757-1968-0_9"},{"issue":"1-2","key":"26_CR4","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.A.: Multi-cut alpha-beta-pruning in game-tree search. Theoretical Computer Science\u00a0252(1-2), 177\u2013196 (2001)","journal-title":"Theoretical Computer Science"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Levy., D., Broughton, D., Taylor, M.: The sex algorithm in computer chess. ICGA Journal\u00a012(1) (1989)","DOI":"10.3233\/ICG-1989-12103"},{"key":"26_CR6","unstructured":"Harris, L.R.: The heuristic search and the game of chess - a study of quiescene, sacrifices, and plan oriented play. In: Proceedings of IJCAI, pp. 334\u2013339 (1975)"},{"issue":"2","key":"26_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/ICG-1998-21202","volume":"21","author":"E.A. Heinz","year":"1998","unstructured":"Heinz, E.A.: Extended futillity pruning. ICGA Journal\u00a021(2), 75\u201383 (1998)","journal-title":"ICGA Journal"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Jiang, A.X., Buro, M.: First experimental results of probcut applied to chess. In: Proceedings of ACG, pp. 19\u201332 (2003)","DOI":"10.1007\/978-0-387-35706-5_2"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1109\/34.106996","volume":"13","author":"H. Kaindl","year":"1991","unstructured":"Kaindl, H., Shams, R., Horacek, H.: Minimax search algorithms with and without aspiration windows. IEEE Trans. Pattern Anal. Mach. Intell.\u00a013, 1225\u20131235 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"26_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell.\u00a06(4), 293\u2013326 (1975)","journal-title":"Artif. Intell."},{"key":"26_CR11","unstructured":"Lim, Y., Lee, W.: Rankcut - a domain independent forward pruning method for games. In: Proceedings of AAAI (2006)"},{"key":"26_CR12","unstructured":"Plaat, A.: Mtd(f) a minimax algorithm faster than negascout (1997), \n                  \n                    http:\/\/people.csail.mit.edu\/plaat\/mtdf.html"},{"issue":"1-2","key":"26_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0004-3702(95)00126-3","volume":"87","author":"A. Plaat","year":"1996","unstructured":"Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-first fixed-depth minimax algorithms. Artif. Intell.\u00a087(1-2), 255\u2013293 (1996)","journal-title":"Artif. Intell."},{"issue":"4","key":"26_CR14","first-page":"4","volume":"6","author":"A. Reinefeld","year":"1983","unstructured":"Reinefeld, A.: An improvement of the scout tree search algorithm. ICCA Journal\u00a06(4), 4\u201314 (1983)","journal-title":"ICCA Journal"},{"issue":"11","key":"26_CR15","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J. Schaeffer","year":"1989","unstructured":"Schaeffer, J.: The history heuristic and alpha-beta search enhancements in practice. IEEE Trans. Pattern Anal. Mach. Intell.\u00a011(11), 1203\u20131212 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"314","key":"26_CR16","first-page":"256","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine\u00a041(314), 256\u2013275 (1950)","journal-title":"Philosophical Magazine"},{"issue":"3","key":"26_CR17","first-page":"172","volume":"27","author":"K.-C. Wu","year":"2004","unstructured":"Wu, K.-C., Hsu, T.-S., Hsu, S.-C.: Contemplation wins Chinese-chess tournament. International Computer Game Association (ICGA) Journal\u00a027(3), 172\u2013173 (2004)","journal-title":"International Computer Game Association (ICGA) Journal"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31866-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:34:31Z","timestamp":1556926471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31866-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318658","9783642318665"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31866-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}