{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T09:51:07Z","timestamp":1768557067849,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4103,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0004-3702(02)00195-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:52:16Z","timestamp":1027626736000},"page":"165-196","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Randomized Best-First Minimax Search"],"prefix":"10.1016","volume":"137","author":[{"given":"Yaron","family":"Shoham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00195-9_BIB001","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","article-title":"The B\u2217 tree search algorithm: A best-first proof procedure","volume":"12","author":"Berliner","year":"1979","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB002","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(95)00092-5","article-title":"B\u2217 probability based search","volume":"86","author":"Berliner","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB003","series-title":"Asynchronous parallel game-tree search, PhD Thesis","author":"Brockington","year":"1994"},{"issue":"3\u20134","key":"10.1016\/S0004-3702(02)00195-9_BIB004","article-title":"Message Passing Interface Forum, MPI: A message-passing interface standard","volume":"8","year":"1994","journal-title":"Internat. J. Supercomput. Appl."},{"issue":"5","key":"10.1016\/S0004-3702(02)00195-9_BIB005","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/277652.277725","article-title":"The implementation of the Cilk-5 multithreaded language","volume":"33","author":"Frigo","year":"1998","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB006","unstructured":"R. Hyatt, Crafty. Computer program, available online from ftp:\/\/ftp.cis.uab.edu\/pub\/hyatt. Some additional documentation available at http:\/\/www.cis.uab.edu\/info\/faculty\/hyatt\/hyatt.html, 1999"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB007","series-title":"Parallel Algorithms: Proceedings of The Third DIMACS Implementation Challenge","first-page":"117","article-title":"The \u2217Socrates massively parallel chess program","volume":"30","author":"Joerg","year":"1996"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB008","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB009","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0004-3702(95)00096-8","article-title":"Best-first minimax search","volume":"84","author":"Korf","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(02)00195-9_BIB010","article-title":"The StarTech massively-parallel chess program","volume":"18","author":"Kuszmaul","year":"1995","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(02)00195-9_BIB011","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(90)90068-B","article-title":"The development of a world-class Othello program","volume":"43","author":"Lee","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB012","unstructured":"F. Louguet, The Louguet Chess Test II (LCT II) FAQ. Available online at http:\/\/www.icdchess.com\/wccr\/testing\/LCTII\/lct2faq.html, April 1996"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB013","unstructured":"T. Marsland, Anatomy of a chess program. In the brochure of the 8th World Computer Chess Championship, May 1995. Available online at http:\/\/www.dcs.qmw.ac.uk\/~icca\/anatomy.htm"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB014","unstructured":"J. Nunn, Nunn-Test II. A collection of 20 middle-game positions, available online with documentation from http:\/\/www.computerschach.de\/test\/nunn2.htm. No date"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB015","series-title":"Searching with Probabilities","author":"Palay","year":"1985"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB016","series-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"Pearl","year":"1984"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB017","unstructured":"E. Schroder, Chess in 2010. Available online at http:\/\/www.rebel.nl\/ches2010.htm"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB018","series-title":"MPI: The Complete Reference, Vol. 1: The MPI Core","author":"Snir","year":"1998"},{"key":"10.1016\/S0004-3702(02)00195-9_BIB019","unstructured":"Supercomputing Technologies Group, MIT Laboratory for Computer Science, Cambridge, MA. Cilk-5.3 Reference Manual, June 2000. Available online at http:\/\/supertech.lcs.mit.edu\/cilk"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202001959?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202001959?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T04:55:26Z","timestamp":1555908926000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202001959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0004370202001959"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00195-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}