{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:26:51Z","timestamp":1761647211933},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0004-3702(90)90073-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"99-109","source":"Crossref","is-referenced-by-count":48,"title":["Singular extensions"],"prefix":"10.1016","volume":"43","author":[{"given":"Thomas","family":"Anantharaman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murray S.","family":"Campbell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-hsiung","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(90)90073-9_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(90)90072-8","article-title":"A generalised quiescence search algorithm","volume":"43","author":"Beal","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(90)90073-9_BIB2","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\/0004-3702(90)90073-9_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(90)90067-A","article-title":"Measuring the performance potential of chess programs","volume":"43","author":"Berliner","year":"1990","journal-title":"Artificial Intelligence"},{"year":"1987","series-title":"All the Right Moves: A VLSI Architecture for Chess","author":"Ebeling","key":"10.1016\/0004-3702(90)90073-9_BIB4"},{"key":"10.1016\/0004-3702(90)90073-9_BIB5","series-title":"Proceedings 1988 AAAI Symposium on Game Playing Systems","article-title":"Experiments with the null move heuristic in chess","author":"Goetsch","year":"1988"},{"key":"10.1016\/0004-3702(90)90073-9_BIB6","series-title":"1987 ISSCC Digest of Technical Papers","first-page":"278","article-title":"A two million moves\/sec CMOS single chip chess move generator","author":"Hsu","year":"1987"},{"key":"10.1016\/0004-3702(90)90073-9_BIB7","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\/0004-3702(90)90073-9_BIB8","doi-asserted-by":"crossref","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\/0004-3702(90)90073-9_BIB9","unstructured":"S. Mahajan, Private communication (1988)."},{"key":"10.1016\/0004-3702(90)90073-9_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","article-title":"Low overhead alternatives to SSS\u2217","volume":"31","author":"Marsland","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(90)90073-9_BIB11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","article-title":"Conspiracy numbers for min-max search","volume":"35","author":"McAllester","year":"1988","journal-title":"Artificial Intelligence"},{"year":"1985","series-title":"Searching with Probabilities","author":"Palay","key":"10.1016\/0004-3702(90)90073-9_BIB12"},{"year":"1945","series-title":"Win at Chess","author":"Reinfeld","key":"10.1016\/0004-3702(90)90073-9_BIB13"},{"key":"10.1016\/0004-3702(90)90073-9_BIB14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0004-3702(87)90004-X","article-title":"Game tree searching by min\/max approximation","volume":"34","author":"Rivest","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(90)90073-9_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(90)90071-7","article-title":"Conspiracy numbers","volume":"43","author":"Schaeffer","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(90)90073-9_BIB16","unstructured":"T. Scherzer, Private communication (1987)."},{"key":"10.1016\/0004-3702(90)90073-9_BIB17","series-title":"Chess Skill in Man and Machine","first-page":"82","article-title":"CHESS 4.5: The Northwestern University chess program","author":"Slate","year":"1977"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370290900739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370290900739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:23:30Z","timestamp":1553646210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370290900739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["0004370290900739"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(90)90073-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}