{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:16:48Z","timestamp":1694636208718},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"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":[[2009,3]]},"DOI":"10.1109\/tciaig.2009.2019632","type":"journal-article","created":{"date-parts":[[2009,4,10]],"date-time":"2009-04-10T19:41:13Z","timestamp":1239392473000},"page":"28-38","source":"Crossref","is-referenced-by-count":0,"title":["Extending the Applicability of Pattern and Endgame Databases"],"prefix":"10.1109","volume":"1","author":[{"given":"M.","family":"Samadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.T.","family":"Asr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Azimifar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"regret minimization in games with incomplete information","author":"zinkevich","year":"2007","journal-title":"Neural Inf Process Soc"},{"key":"ref38","first-page":"677","article-title":"space-efficient memory-based heuristics","author":"zhou","year":"2004","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref33","author":"strohlein","year":"1970","journal-title":"Untersuchungen ber kombinatorische Spiele"},{"key":"ref32","first-page":"333","author":"shi","year":"2002","journal-title":"Computers and Games"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00166-7"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1613\/jair.1534","article-title":"an improved search algorithm for optimal multiple-sequence alignment","volume":"23","author":"schroedl","year":"2005","journal-title":"J Artif Intell Res"},{"key":"ref37","author":"ulfhake","year":"2000","journal-title":"A Chinese Checkers-playing program"},{"key":"ref36","first-page":"131","article-title":"retrograde analysis of certain endgames","volume":"9","author":"thompson","year":"1986","journal-title":"J Int Comput Chess Assoc"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/203330.203343"},{"key":"ref34","author":"sturtevant","year":"2009","journal-title":"HOG"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1007\/978-3-540-74565-5_36","volume":"4467","author":"edelkamp","year":"2007","journal-title":"Lecture Notes in Computer Science"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-247-2.50024-3"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1613\/jair.1480","article-title":"additive pattern database heuristics","volume":"22","author":"felner","year":"2004","journal-title":"J Artif Intell Res"},{"key":"ref13","first-page":"638","article-title":"compressing pattern databases","author":"felner","year":"2004","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref14","first-page":"103","article-title":"dual lookups in pattern databases","author":"felner","year":"2005","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref15","first-page":"62","article-title":"general game playing: overview of the aaai competition","volume":"26","author":"genesereth","year":"2005","journal-title":"AI Mag"},{"key":"ref16","first-page":"228","article-title":"partition search","author":"ginsberg","year":"1996","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref17","author":"hsu","year":"2002","journal-title":"Behind Deep Blue"},{"key":"ref18","author":"hutton","year":"2001","journal-title":"Developing computer opponents for Chinese Checkers"},{"key":"ref19","author":"hyatt","year":"2008","journal-title":"Welcome to the Crafty Chess page"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-76576-1"},{"key":"ref4","author":"breuker","year":"1998","journal-title":"Memory Versus Search in Games"},{"key":"ref27","first-page":"545","article-title":"using abstraction in two-player games","author":"samadi","year":"2008","journal-title":"Proc Eur Conf Artif Intell"},{"key":"ref3","author":"bleicher","year":"2008","journal-title":"Web query for Nalimov endgame tablebases"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45622-8_5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1126\/science.1144079"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00093-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1111\/0824-7935.00065"},{"key":"ref7","author":"culberson","year":"1994","journal-title":"Efficiently searching the 15-puzzle"},{"key":"ref2","first-page":"661","article-title":"approximating game-theoretic optimal strategies for full-scale poker","author":"billings","year":"2003","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85845-4_24"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007634325138"},{"key":"ref20","first-page":"700","article-title":"finding optimal solutions to rubik's cube using pattern databases","author":"korf","year":"1997","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref22","first-page":"2324","article-title":"recent progress in heuristic search: a case study of the four-peg towers of hanoi problem","author":"korf","year":"2007","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00092-3"},{"key":"ref24","author":"kostenko","year":"2007","journal-title":"Calculating end game databases for general game playing"},{"key":"ref23","first-page":"910","article-title":"divide-and-conquer frontier search applied to optimal sequence alignment","author":"korf","year":"2000","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref26","first-page":"737","article-title":"memory efficient heuristics for multiple sequence alignment","author":"mcnaughton","year":"2002","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref25","first-page":"1457","article-title":"automatic heuristic construction for general game playing","author":"kuhlmann","year":"2006","journal-title":"Proc Nat Conf Artif Intell"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4804728\/4907343\/04811953.pdf?arnumber=4811953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:42Z","timestamp":1633909902000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4811953\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":39,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2009.2019632","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}