{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:05Z","timestamp":1725564365298},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_5","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:03:50Z","timestamp":1283713430000},"page":"61-74","source":"Crossref","is-referenced-by-count":6,"title":["PDS-PN: A New Proof-Number Search Algorithm"],"prefix":"10.1007","author":[{"given":"Mark H. M.","family":"Winands","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos W. H. M.","family":"Uiterwijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaap","family":"van den Herik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","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, J., Hsu, F.: Deep Blue. Artificial Intelligence\u00a0134, 57\u201383 (2002)","journal-title":"Artificial Intelligence"},{"key":"5_CR2","first-page":"148","volume":"23","author":"E. Nalimov","year":"2000","unstructured":"Nalimov, E., Haworth, G., Heinz, E.: Space-efficient indexing of chess endgame tables. International Computer Games Association Journal\u00a023, 148\u2013162 (2000)","journal-title":"International Computer Games Association Journal"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0004-3702(94)90004-3","volume":"66","author":"V. Allis","year":"1994","unstructured":"Allis, V., van der Meulen, M., van den Herik, J.: Proof-number search. Artificial Intelligence\u00a066, 91\u2013123 (1994)","journal-title":"Artificial Intelligence"},{"key":"5_CR4","unstructured":"Breuker, D., Allis, V., van den Herik, J.: How to mate: Applying proof-number search. In: van den Herik, J., Herschberg, I., Uiterwijk, J. (eds.) Advances in Computer Chess 7, University of Limburg, pp. 251\u2013272 (1994)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0004-3702(01)00084-4","volume":"129","author":"M. Seo","year":"2001","unstructured":"Seo, M., Iida, H., Uiterwijk, J.: The PN*-search algorithm: Application to Tsumeshogi. Artificial Intelligence\u00a0129, 253\u2013277 (2001)","journal-title":"Artificial Intelligence"},{"key":"5_CR6","unstructured":"Sackson, S.: A Gamut of Games. Random House (1969)"},{"key":"5_CR7","unstructured":"Winands, M.: Analysis and implementation of Lines of Action. Master\u2019s thesis, Department of Computer Science, Universiteit Maastricht (2000)"},{"key":"5_CR8","first-page":"3","volume":"24","author":"M. Winands","year":"2001","unstructured":"Winands, M., Uiterwijk, J., van den Herik, J.: The quad heuristic in Lines of Action. International Computer Games Association Journal\u00a024, 3\u201315 (2001)","journal-title":"International Computer Games Association Journal"},{"key":"5_CR9","unstructured":"Allis, V.: Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of Computer Science, University of Limburg (1994)"},{"key":"5_CR10","unstructured":"Winands, M., Uiterwijk, J.: PN, PN2 and PN* in Lines of Action. Technical report, Department of Computer Science, Universiteit Maastricht (2001)"},{"key":"5_CR11","unstructured":"Breuker, D.: Memory versus Search in Games. PhD thesis, Department of Computer Science, Universiteit Maastricht (1998)"},{"key":"5_CR12","unstructured":"Breuker, D., Uiterwijk, J., van den Herik, J.: The PN2-search algorithm. In: van den Herik, J., Monien, B. (eds.) Advances in Computer Games 9, Universiteit Maastricht, pp. 115\u2013132 (2001)"},{"key":"5_CR13","unstructured":"Berkey, D.: Calculus. Saunders College Publishing (1988)"},{"key":"5_CR14","unstructured":"Nagai, A.: A new AND\/OR tree search algorithm using proof number and disproof number. In: Proceedings of Complex Games Lab Workshop, ETL, Tsukuba, Japan, pp. 40\u201345 (1998)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Nagai, A.: A new depth-first-search algorithm for AND\/OR trees. Master\u2019s thesis, The University of Tokyo (1999)","DOI":"10.3233\/ICG-1999-22106"},{"key":"5_CR16","first-page":"175","volume":"19","author":"D. Breuker","year":"1996","unstructured":"Breuker, D., Uiterwijk, J., van den Herik, J.: Replacement schemes and two-level tables. International Computer Chess Association Journal\u00a019, 175\u2013180 (1996)","journal-title":"International Computer Chess Association Journal"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(00)00079-7","volume":"252","author":"D. Breuker","year":"2001","unstructured":"Breuker, D., van den Herik, J., Uiterwijk, J., Allis, V.: A solution to the GHI problem for best-first search. Theoretical Computer Science\u00a0252, 121\u2013149 (2001)","journal-title":"Theoretical Computer Science"},{"key":"5_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-45517-5_6","volume-title":"Engineering of Intelligent Systems","author":"L. Kocsis","year":"2001","unstructured":"Kocsis, L., Uiterwijk, J., van den Herik, J.: Move ordering using neural networks. In: Monostori, L., V\u00e1ncza, J., Ali, M. (eds.) IEA\/AIE 2001. LNCS (LNAI), vol.\u00a02070, pp. 45\u201350. Springer, Heidelberg (2001)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1145\/800179.810240","volume-title":"1977 ACM Annual Conference Proceedings","author":"S. Akl","year":"1977","unstructured":"Akl, S., Newborn, M.: The principal continuation and the killer heuristic. In: 1977 ACM Annual Conference Proceedings, pp. 466\u2013473. ACM, New York (1977)"},{"key":"5_CR20","unstructured":"Sakuta, M., Iida, H.: The performance of PN*, PDS and PN search on 6\u00d76 Othello and Tsume-shogi. In: van den Herik, J., Monien, B. (eds.) Advances in Computer Games 9, Universiteit Maastricht, pp. 203\u2013222 (2001)"},{"key":"5_CR21","unstructured":"Nagai, A.: DF-PN Algorithm for Searching AND\/OR Trees and Its Applications. PhD thesis, The University of Tokyo (2002)"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T17:15:37Z","timestamp":1559582137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40031-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205456","9783540400318"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40031-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}