{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:23:49Z","timestamp":1742977429093,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319054278"},{"type":"electronic","value":"9783319054285"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05428-5_7","type":"book-chapter","created":{"date-parts":[[2014,3,31]],"date-time":"2014-03-31T10:56:18Z","timestamp":1396263378000},"page":"81-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["WALTZ: A Strong Tzaar-Playing Program"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Valla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Vesel\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,1]]},"reference":[{"key":"7_CR1","unstructured":"Allis, L.V.: Searching for solutions in games and artificial intelligence. Ph.D. thesis, University of Limburg, Maastricht, The Netherlands (1994)"},{"key":"7_CR2","unstructured":"Burm, K.: Tzaar rules. GIPF Project. http:\/\/www.gipf.com\/tzaar\/rules\/rules.html"},{"issue":"3","key":"7_CR3","first-page":"181","volume":"19","author":"S Chinchalkar","year":"1996","unstructured":"Chinchalkar, S.: An upper bound for the number of reachable positions. ICCA J. 19(3), 181\u2013183 (1996)","journal-title":"ICCA J."},{"key":"7_CR4","series-title":"LNCS","first-page":"157","volume-title":"CG 2008","author":"T Ueda","year":"2008","unstructured":"Ueda, T., Hashimoto, T., Hashimoto, J., Iida, H.: Weak Proof-number search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 157\u2013168. Springer, Heidelberg (2008)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Kishimoto, A.: Dealing with infinite loops, underestimation, and overestimation of depth-first proof-number search. In: Fox, M., Poole, D. (eds.) Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7534"},{"key":"7_CR6","unstructured":"Nagai, A.: Df-pn algorithm for searching AND\/OR trees and its applications. Ph.D. thesis, The University of Tokyo, Japan (2002)"},{"key":"7_CR7","series-title":"LNCS","first-page":"160","volume-title":"CG 2006","author":"J Pawlewicz","year":"2007","unstructured":"Pawlewicz, J., Lew, \u0141.: Improving depth-first PN-search: 1 + $$\\epsilon $$ trick. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 160\u2013171. Springer, Heidelberg (2007)"},{"key":"7_CR8","series-title":"LNCS","first-page":"196","volume-title":"ACG 2011","author":"A Saffidine","year":"2012","unstructured":"Saffidine, A., Jouandeau, N., Cazenave, T.: Solving breakthrough with race patterns and job-level proof number search. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 196\u2013207. Springer, Heidelberg (2012)"},{"key":"7_CR9","series-title":"LNCS","first-page":"75","volume-title":"ACG 2009","author":"J-T Saito","year":"2010","unstructured":"Saito, J.-T., Winands, M.H.M., van den Herik, H.J.: Randomized parallel proof-number search. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 75\u201387. Springer, Heidelberg (2010)"},{"issue":"4","key":"7_CR10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.3233\/ICG-2000-23402","volume":"23","author":"T Thomsen","year":"2001","unstructured":"Thomsen, T.: Lambda-search in game trees - with application to go. ICGA J. 23(4), 203\u2013217 (2001). (Springer)","journal-title":"ICGA J."},{"key":"7_CR11","unstructured":"Valla, T., Vesel\u00fd, P.: Waltz. http:\/\/kam.mff.cuni.cz\/~vesely\/tzaar\/"},{"key":"7_CR12","unstructured":"Vasconcelos, P.: HsTZAAR. http:\/\/www.dcc.fc.up.pt\/~pbv\/stuff\/hstzaar\/"},{"key":"7_CR13","unstructured":"Vesel\u00fd, P.: Artificial intelligence in abstract 2-player games. Bachelor\u2019s thesis, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic. http:\/\/kam.mff.cuni.cz\/~vesely\/tzaar\/thesis.pdf (2012)"},{"key":"7_CR14","unstructured":"Wentink, D.: Analysis and implementation of the game Gipf. Master\u2019s thesis, Universiteit Maastricht (2001)"},{"key":"7_CR15","series-title":"LNCS","first-page":"23","volume-title":"CG 2010","author":"MHM Winands","year":"2011","unstructured":"Winands, M.H.M., Schadd, M.P.D.: Evaluation-function based proof-number search. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 23\u201335. Springer, Heidelberg (2011)"},{"key":"7_CR16","series-title":"LNCS","first-page":"11","volume-title":"CG 2010","author":"I-C Wu","year":"2011","unstructured":"Wu, I.-C., Lin, H.-H., Lin, P.-H., Sun, D.-J., Chan, Y.-C., Chen, B.-T.: Job-level proof-number search for Connect6. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 11\u201322. Springer, Heidelberg (2011). http:\/\/dl.acm.org\/citation.cfm?id=1950322.1950324"},{"key":"7_CR17","series-title":"LNCS","first-page":"135","volume-title":"CG 2008","author":"K Yoshizoe","year":"2008","unstructured":"Yoshizoe, K.: A new proof-number calculation technique for proof-number search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 135\u2013145. Springer, Heidelberg (2008)"},{"key":"7_CR18","unstructured":"Boiteajeux board-gaming portal. http:\/\/www.boiteajeux.net\/"},{"key":"7_CR19","unstructured":"GAMES game awards. Games Magazine. http:\/\/www.gamesmagazine-online.com\/gameslinks\/archives.html2009awards"},{"key":"7_CR20","unstructured":"List of games, ICGA tournaments. [cit. 2013-05-11]. http:\/\/www.grappa.univ-lille3.fr\/icga\/games.php"},{"key":"7_CR21","unstructured":"Spiel des jahres, awarded games 2008. http:\/\/www.spiel-des-jahres.com\/cms\/front_content.php?idart=925"},{"key":"7_CR22","unstructured":"Tzaar - ai game project for 2011. http:\/\/www.math.uaa.alaska.edu\/~afkjm\/cs405\/tzaar\/"}],"container-title":["Communications in Computer and Information Science","Computer Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05428-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T07:13:54Z","timestamp":1674544434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05428-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319054278","9783319054285"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05428-5_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 April 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}