{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:54:02Z","timestamp":1743018842045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319279916"},{"type":"electronic","value":"9783319279923"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27992-3_19","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T12:24:21Z","timestamp":1450959861000},"page":"210-222","source":"Crossref","is-referenced-by-count":2,"title":["Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search"],"prefix":"10.1007","author":[{"given":"Shu","family":"Yokoyama","sequence":"first","affiliation":[]},{"given":"Tomoyuki","family":"Kaneko","sequence":"additional","affiliation":[]},{"given":"Tetsuro","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"19_CR1","unstructured":"Brockington, M.: Asynchronous Parallel Game-Tree Search. Ph.D. thesis, University of Alberta (1998)"},{"issue":"1\u20132","key":"19_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00129-1","volume":"134","author":"M Campbell","year":"2002","unstructured":"Campbell, M., Hoane Jr., A.J., Hsu, F.H.: Deep blue. Artif. Intell. 134(1\u20132), 57\u201383 (2002)","journal-title":"Artif. Intell."},{"key":"19_CR3","unstructured":"Donninger, C., Kure, A., Lorenz, U.: Parallel brutus: the first distributed, FPGA accelerated chess program. In: Proceedings of the 18th International Symposium on Parallel and Distributed Processing, 2004, p. 44, April 2004"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/978-3-540-30117-2_101","volume-title":"Field Programmable Logic and Application","author":"C Donninger","year":"2004","unstructured":"Donninger, C., Lorenz, U.: The chess monster hydra. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol. 3203, pp. 927\u2013932. Springer, Heidelberg (2004)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Feldmann, R.: Game Tree Search on Massively Parallel Systems. Ph.D. thesis, University of Paderborn (1993)","DOI":"10.1007\/3-540-55488-2_32"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-45579-5_18","volume-title":"Computers and Games","author":"EA Heinz","year":"2002","unstructured":"Heinz, E.A.: New self-play results in computer chess. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 262\u2013276. Springer, Heidelberg (2002)"},{"issue":"2","key":"19_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.3233\/ICG-2005-28203","volume":"28","author":"K Himstedt","year":"2005","unstructured":"Himstedt, K.: An optimistic pondering approach for asynchronous distributed game-tree search. ICGA J. 28(2), 77\u201390 (2005)","journal-title":"ICGA J."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.3233\/ICG-2012-35202","volume":"35","author":"K Himstedt","year":"2012","unstructured":"Himstedt, K.: Gridchess: combining optimistic pondering with the young brothers wait concept. ICGA J. 35(2), 67\u201379 (2012)","journal-title":"ICGA J."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-540-85451-7_62","volume-title":"Euro-Par 2008 Parallel Processing","author":"K Himstedt","year":"2008","unstructured":"Himstedt, K., Lorenz, U., M\u00f6ller, D.P.F.: A twofold distributed game-tree search approach using interconnected clusters. In: Luque, E., Margalef, T., Ben\u00edtez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 587\u2013598. Springer, Heidelberg (2008)"},{"issue":"2","key":"19_CR10","first-page":"55","volume":"14","author":"K Hoki","year":"2013","unstructured":"Hoki, K., Kaneko, T., Yokoyama, D., Obata, T., Yamashita, H., Tsuruoka, Y., Ito, T.: Distributed-shogi-system Akara 2010 and its demonstration. Int. J. Comput. Inf. Sci. 14(2), 55\u201363 (2013)","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"9","key":"19_CR11","first-page":"914","volume":"54","author":"T Kaneko","year":"2013","unstructured":"Kaneko, T., Tanaka, T.: Distributed game tree search and improvements \u2013 match between hiroyuki miura and GPSShogi. IPSJ Mag. 54(9), 914\u2013922 (2013). (In Japanese)","journal-title":"IPSJ Mag."},{"key":"19_CR12","unstructured":"Kishimoto, A.: Transposition table driven scheduling for two-player games. M.Sc. thesis, University of Alberta, January 2002"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293\u2013326 (1975)","journal-title":"Artif. Intell."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/TPAMI.1985.4767683","volume":"7","author":"TA Marsland","year":"1985","unstructured":"Marsland, T.A., Popowich, F.: Parallel game-tree search. IEEE Trans. Pattern Anal. Mach. Intell. 7, 442\u2013452 (1985)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-17928-0_15","volume-title":"Computers and Games","author":"T Obata","year":"2011","unstructured":"Obata, T., Sugiyama, T., Hoki, K., Ito, T.: Consultation algorithm for computer shogi: move decisions by majority. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 156\u2013165. Springer, Heidelberg (2011)"},{"key":"19_CR16","unstructured":"Tanaka, T., Kaneko, T.: Massively parallel execution of shogi programs. In: The Special Interest Group Technical Reports of IPSJ. 2, vol. GI-24, pp. 1\u20138 (2010) (In Japanese)"},{"issue":"3","key":"19_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/ICG-2002-25304","volume":"25","author":"Y Tsuruoka","year":"2002","unstructured":"Tsuruoka, Y., Yokoyama, D., Chikayama, T.: Game-tree search algorithm based on realization probability. ICGA J. 25(3), 145\u2013152 (2002)","journal-title":"ICGA J."},{"issue":"1","key":"19_CR18","first-page":"17","volume":"21","author":"A Ura","year":"2013","unstructured":"Ura, A., Yokoyama, D., Chikayama, T.: Two-level task scheduling for parallel game tree search based on necessity. J. Inf. Process. 21(1), 17\u201325 (2013)","journal-title":"J. Inf. Process."}],"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-319-27992-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T18:16:35Z","timestamp":1653934595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27992-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279916","9783319279923"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27992-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}