{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:22:48Z","timestamp":1742912568101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"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_18","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T07:24:21Z","timestamp":1450941861000},"page":"198-209","source":"Crossref","is-referenced-by-count":0,"title":["Feature Strength and Parallelization of Sibling Conspiracy Number Search"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Pawlewicz","sequence":"first","affiliation":[]},{"given":"Ryan B.","family":"Hayward","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"18_CR1","unstructured":"Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, Maastricht, The Netherlands (1994)"},{"issue":"1\u20132","key":"18_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0004-3702(01)00154-0","volume":"134","author":"VV Anshelevich","year":"2002","unstructured":"Anshelevich, V.V.: A hierarchical approach to computer Hex. Artif. Intell. 134(1\u20132), 101\u2013120 (2002)","journal-title":"Artif. Intell."},{"key":"18_CR3","unstructured":"Arneson, B., Henderson, P., Hayward, R.B.: Benzene (2009). http:\/\/benzene.sourceforge.net\/"},{"key":"18_CR4","unstructured":"Breuker, D.M.: Memory versus Search in Games. PhD thesis, Maastricht University, Maastricht, The Netherlands (1998)"},{"key":"18_CR5","unstructured":"Coulom, R.: Bayesian elo rating (2010). http:\/\/remi.coulom.free.fr\/Bayesian-Elo"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-642-31866-5_13","volume-title":"Advances in Computer Games","author":"R Coulom","year":"2012","unstructured":"Coulom, R.: CLOP: confident local optimization for noisy black-box parameter tuning. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 146\u2013157. Springer, Heidelberg (2012)"},{"key":"18_CR7","unstructured":"Gardner, M.: The 2nd scientific american book of mathematical puzzles and diversions, Chap. 7, pp. 78\u201388. Simon and Schuster, New York (1961)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: 24th ACM ICML, pp. 273\u2013280 (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"18_CR9","unstructured":"Henderson, P.: Playing and solving Hex. PhD thesis, UAlberta (2010). http:\/\/webdocs.cs.ualberta.ca\/~hayward\/theses\/ph.pdf"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-319-09165-5_6","volume-title":"Computer and Games","author":"S-C Huang","year":"2014","unstructured":"Huang, S.-C., Arneson, B., Hayward, R.B., M\u00fcller, M., Pawlewicz, J.: MoHex 2.0: a pattern-based MCTS Hex player. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 60\u201371. Springer, Heidelberg (2014)"},{"issue":"1\u20132","key":"18_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0004-3702(01)00157-6","volume":"134","author":"H Iida","year":"2002","unstructured":"Iida, H., Sakuta, M., Rollason, J.: Computer shogi. Artif. Intell. 134(1\u20132), 121\u2013144 (2002)","journal-title":"Artif. Intell."},{"issue":"3","key":"18_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/ICG-2012-35302","volume":"35","author":"A Kishimoto","year":"2012","unstructured":"Kishimoto, A., Winands, M., M\u00fcller, M., Saito, J.-T.: Game-tree searching with proof numbers: the first twenty years. ICGA J. 35(3), 131\u2013156 (2012)","journal-title":"ICGA J."},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-8640.1990.tb00125.x","volume":"6","author":"N Klingbeil","year":"1990","unstructured":"Klingbeil, N., Schaeffer, J.: Empirical results with conspiracy numbers. Comput. Intell. 6, 1\u201311 (1990)","journal-title":"Comput. Intell."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-45706-2_57","volume-title":"Euro-Par 2002. Parallel Processing","author":"U Lorenz","year":"2002","unstructured":"Lorenz, U.: Parallel controlled conspiracy number search. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 420\u2013430. Springer, Heidelberg (2002)"},{"issue":"3","key":"18_CR15","first-page":"135","volume":"18","author":"U Lorenz","year":"1995","unstructured":"Lorenz, U., Rottmann, V., Feldman, R., Mysliwietz, P.: Controlled conspiracy number search. ICCA J. 18(3), 135\u2013147 (1995)","journal-title":"ICCA J."},{"issue":"3","key":"18_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"D McAllester","year":"1988","unstructured":"McAllester, D.: Conspiracy numbers for min-max search. Artif. Intell. 35(3), 287\u2013310 (1988)","journal-title":"Artif. Intell."},{"issue":"1","key":"18_CR17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.3233\/ICG-2002-25103","volume":"25","author":"D McAllester","year":"2002","unstructured":"McAllester, D., Yuret, D.: Alpha-beta conspiracy search. ICGA 25(1), 16\u201335 (2002)","journal-title":"ICGA"},{"key":"18_CR18","unstructured":"Nagai, A.: Df-pn Algorithm for Searching AND\/OR Trees and Its Applications. Ph.d. thesis, Department of Information Science, University Tokyo, Tokyo, Japan (2002)"},{"key":"18_CR19","unstructured":"Pawlewicz, J., Hayward, R.: Sibling conspiracy number search. manuscript (2015)"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-319-09165-5_12","volume-title":"Computer and Games","author":"J Pawlewicz","year":"2014","unstructured":"Pawlewicz, J., Hayward, R.B.: Scalable parallel DFPN search. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 138\u2013150. Springer, Heidelberg (2014)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-540-75538-8_14","volume-title":"Computers and Games","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":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-540-75538-8_5","volume-title":"Computers and Games","author":"J-T Saito","year":"2007","unstructured":"Saito, J.-T., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M., van den Herik, H.J.: Monte-Carlo proof-number search for computer Go. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 50\u201361. Springer, Heidelberg (2007)"},{"issue":"1","key":"18_CR23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0004-3702(90)90071-7","volume":"43","author":"J Schaeffer","year":"1990","unstructured":"Schaeffer, J.: Conspiracy numbers. Artif. Intell. 43(1), 67\u201384 (1990)","journal-title":"Artif. Intell."},{"key":"18_CR24","unstructured":"van der Meulen, M.: Parallel conspiracy-number search. Master\u2019s thesis, Vrije Universiteit Amsterdam, The Netherlands (1988)"},{"key":"18_CR25","unstructured":"Winands, M.: Informed Search in Complex Games. PhD thesis, Universiteit Maastricht, Maastricht, The Netherlands (2004)"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-642-17928-0_3","volume-title":"Computers and Games","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)"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T19:07:10Z","timestamp":1567451230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27992-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279916","9783319279923"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27992-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}