{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:29:13Z","timestamp":1760596153605},"reference-count":39,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":5594,"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":[[1998,4]]},"DOI":"10.1016\/s0004-3702(97)00082-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"87-123","source":"Crossref","is-referenced-by-count":60,"title":["Search in games with incomplete information: a case study using Bridge card play"],"prefix":"10.1016","volume":"100","author":[{"given":"Ian","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Basin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(97)00082-9_BIB1","series-title":"The Official Encyclopedia of Bridge","author":"ACBL","year":"1994"},{"issue":"4","key":"10.1016\/S0004-3702(97)00082-9_BIB2_1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1145\/321172.321182","article-title":"Program for double-dummy Bridge problems\u2014a new strategy for mechanical game playing","volume":"10","author":"Berlekamp","year":"1963","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB2_2","series-title":"Computer Games II","year":"1988"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB3","series-title":"Proceedings IJCAI-85","first-page":"1047","article-title":"Span: integrating problem solving tactics","author":"Berlin","year":"1985"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB4","series-title":"Games: Planning and Learning, Papers from the 1993 Fall Symposium","first-page":"59","article-title":"Games with imperfect information","author":"Blair","year":"1993"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB5","article-title":"A program to play Contract Bridge","author":"Carley","year":"1962"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB6","unstructured":"E. Crowhurst, Personal communication, May 17, 1996 (Crowhurst made a point of crediting Dorothy Truscott with helping him to verify his results)."},{"key":"10.1016\/S0004-3702(97)00082-9_BIB7","series-title":"Heuristic Programming in Artificial Intelligence 2\u2014The Second Computer Olympiad","first-page":"204","article-title":"Brute force search in games of imperfect information","author":"Frank","year":"1989"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB8","article-title":"Search and planning under incomplete information: A study using Bridge card play","author":"Frank","year":"1996"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB9","series-title":"Proceedings Fourth Game Programming Workshop in Japan (GPW-97)","article-title":"Payoff-reduction minimaxing","author":"Frank","year":"1997"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB10","series-title":"Proceedings ECAI-92","first-page":"72","article-title":"An adaptation of proof-planning to declarer play in Bridge","author":"Frank","year":"1992"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB11_1","series-title":"Heuristic Programming in Artificial Intelligence 2\u2014The Second Computer Olympiad","first-page":"87","article-title":"An architecture for a sophisticated mechanical Bridge player","author":"Gamb\u00e4ck","year":"1991"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB11_2","author":"Gamb\u00e4ck","year":"1993"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB12","first-page":"24","article-title":"Playing to win","author":"Geake","year":"1992"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB13","series-title":"GIB vs Bridge Baron: results, Usenet news message posted on the newsgroup rec.games.Bridge","author":"Ginsberg","year":"1996"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB14","series-title":"How computers will play Bridge","author":"Ginsberg","year":"1996"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB15","series-title":"Proceedings AAAI-96","first-page":"228","article-title":"Partition search","author":"Ginsberg","year":"1996"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB16","unstructured":"F. Gitelman, Bridge master, Computer Bridge Program, 15 Lillian Street, Toronto, ON, Canada M4S 2H7."},{"key":"10.1016\/S0004-3702(97)00082-9_BIB17","article-title":"Complete contingency planners","author":"Kibler","year":"1992"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB18","first-page":"328","article-title":"Generalized game trees","volume":"Vol. 1","author":"Korf","year":"1989"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB19","series-title":"Reviews from Canadian Master Point","year":"1992"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB20","series-title":"Heuristic Programming in Artificial Intelligence\u2014The First Computer Olympiad","first-page":"95","article-title":"The million pound Bridge program","author":"Levy","year":"1989"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB21","series-title":"Games and Decisions\u2014Introduction and Critical Survey","author":"Luce","year":"1957"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB22","article-title":"Hibrid: a hierarchically designed Bridge playing program","author":"Lustig","year":"1985"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB23","article-title":"Bridge software: moving forwards or backwards?","author":"Manley","year":"1994"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB24","article-title":"Declarer: a learning Bridge-playing program which generalizes and infers","author":"Napjus","year":"1969"},{"issue":"54","key":"10.1016\/S0004-3702(97)00082-9_BIB25","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","article-title":"Non-cooperative games","volume":"2","author":"Nash","year":"1951","journal-title":"Ann. of Math."},{"key":"10.1016\/S0004-3702(97)00082-9_BIB26","series-title":"Uncertainty in Artificial Intelligence","first-page":"505","article-title":"An evaluation of two alternatives to minimax","author":"Nau","year":"1988"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB27","series-title":"Proceedings 10th Israeli Symposium on Artificial Intelligence","first-page":"51","article-title":"Aspen\u2014designing complex knowledge based systems","author":"Nygate","year":"1993"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB28","first-page":"554","article-title":"Heuristic search theory: survey of recent results","volume":"vol. 1","author":"Pearl","year":"1981"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB29","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0004-3702(83)90004-8","article-title":"On the nature of pathology in game searching","volume":"20","author":"Pearl","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB30","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","article-title":"Programming a computer for playing chess","volume":"41","author":"Shannon","year":"1950","journal-title":"Philos. Mag."},{"key":"10.1016\/S0004-3702(97)00082-9_BIB31","series-title":"Games: Planning and Learning, Papers from the 1993 Fall Symposium","first-page":"84","article-title":"Strategic planning for imperfect information games","author":"Smith","year":"1993"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB32_1","series-title":"Proceedings AISB Summer Conference","first-page":"256","article-title":"Planning to make tricks at Bridge","author":"Stanier","year":"1976"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB32_2","series-title":"Computer Games II","year":"1988"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB33","series-title":"Computer Bridge","author":"Throop","year":"1983"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB34","series-title":"Theory of Games and Economic Behaviour","author":"von Neumann","year":"1944"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB35","first-page":"26","article-title":"Beaten in spades","author":"Walker","year":"1996"},{"key":"10.1016\/S0004-3702(97)00082-9_BIB36","series-title":"Heuristic Programming in Artificial Intelligence\u2014The First Computer Olympiad","first-page":"89","article-title":"Solving double dummy Bridge problems by exhaustive search","author":"Wheen","year":"1989"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000829?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000829?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:50:10Z","timestamp":1555066210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370297000829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0004370297000829"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(97)00082-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}