{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:33:33Z","timestamp":1740155613478,"version":"3.37.3"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1109\/tciaig.2015.2505240","type":"journal-article","created":{"date-parts":[[2015,12,3]],"date-time":"2015-12-03T14:07:54Z","timestamp":1449151674000},"page":"76-87","source":"Crossref","is-referenced-by-count":3,"title":["Partition Search Revisited"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3048-3704","authenticated-orcid":false,"given":"Piotr","family":"Beling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00082-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2200894"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.08.002"},{"article-title":"Machine solution of no-trump double-dummy bridge problems","year":"1962","author":"berlekamp","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/321172.321182"},{"key":"ref15","first-page":"143","article-title":"Scout: A simple game-searching algorithm with proven optimal properties","author":"pearl","year":"0","journal-title":"Proc Assoc Adv Artif Intell"},{"article-title":"Building a fast double-dummy bridge solver","year":"1996","author":"chang","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005526"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2009.5286484"},{"key":"ref19","first-page":"95","author":"levy","year":"0","journal-title":"Heuristic Programming in Artificial Intelligence The First Computer Olympiad"},{"key":"ref4","first-page":"534","article-title":"Using payoff-similarity to speed up search","volume":"1","author":"furtak","year":"0","journal-title":"Proc 22nd Int Joint Conf Artif Intell"},{"article-title":"Symmetries and search in trick-taking card games","year":"2013","author":"furtak","key":"ref3"},{"key":"ref6","article-title":"How computers will play bridge","volume":"67","author":"ginsberg","year":"1996","journal-title":"The Bridge World"},{"key":"ref5","article-title":"An analysis of the law of total tricks","volume":"68","author":"ginsberg","year":"1996","journal-title":"The Bridge World"},{"year":"0","key":"ref8","article-title":"Wikipedia"},{"article-title":"The state of automated bridge play","year":"2010","author":"bethe","key":"ref7"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1613\/jair.820","article-title":"GIB: Imperfect information in a computationally challenging game","volume":"14","author":"ginsberg","year":"2001","journal-title":"J Artif Intell Res"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_11"},{"key":"ref1","first-page":"228","article-title":"Partition search","volume":"1","author":"ginsberg","year":"1996","journal-title":"Proc AAAI\/IAAI"},{"key":"ref20","first-page":"3","article-title":"A review of game-tree pruning","volume":"9","author":"marsland","year":"1986","journal-title":"Int Comput Chess Assoc J"},{"article-title":"Szybkie algorytmy decyzyjne w grach z doskona?a informacja i ich wykorzystanie w grach jej pozbawionych [effective decision making algorithms for games with perfect information and their applications in games without it]","year":"0","author":"beling","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(75)90019-3"},{"key":"ref24","first-page":"5","article-title":"Efektywne rozwiazanie problemu rozgrywki w otwarte karty w bryd?u [an implementation of effective double dummy bridge solver]","volume":"3","author":"beling","year":"2011","journal-title":"Metody Informatyki Stosowanej"},{"article-title":"Search algorithms for a bridge double dummy solver","year":"2010","author":"haglund","key":"ref23"},{"key":"ref26","first-page":"234","article-title":"Exploiting graph properties of game trees","volume":"1","author":"plaat","year":"0","journal-title":"Proc 13th Nat Conf Artif Intell 8th Innovative Appl Artif Intell Conf (AAAI\/IAAI)"},{"journal-title":"Nearly Optimal Minimax Tree Search","year":"1994","author":"plaat","key":"ref25"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4804728\/4804729\/07346447.pdf?arnumber=7346447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:45:39Z","timestamp":1641987939000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7346447\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":26,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2015.2505240","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"type":"print","value":"1943-068X"},{"type":"electronic","value":"1943-0698"}],"subject":[],"published":{"date-parts":[[2017,3]]}}}