{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T02:18:22Z","timestamp":1767665902631},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National Science Council of the Republic of China (Taiwan)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/tciaig.2014.2317832","type":"journal-article","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T18:02:20Z","timestamp":1397671340000},"page":"109-122","source":"Crossref","is-referenced-by-count":17,"title":["Equivalence Classes in Chinese Dark Chess Endgames"],"prefix":"10.1109","volume":"7","author":[{"given":"Jr-Chang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ting-Yu","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Bo-Nian","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Tsan-sheng","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","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":"Artif Intell"},{"key":"ref11","article-title":"Space-efficient indexing of endgame databases for chess","volume":"9","author":"nalimov","year":"2000","journal-title":"Advances in Computer Chess"},{"key":"ref12","first-page":"195","article-title":"KQQKQQ and the Kasparov-world game","volume":"22","author":"nalimov","year":"2000","journal-title":"ICCA J"},{"key":"ref13","first-page":"4","article-title":"An improvement of the scout tree search algorithm","volume":"6","author":"reinefeld","year":"1983","journal-title":"ICCA J"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2098876"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1126\/science.1144079"},{"key":"ref16","first-page":"131","article-title":"Retrograde analysis of certain endgames","volume":"9","author":"thompson","year":"1986","journal-title":"ICCA J"},{"key":"ref17","first-page":"215","article-title":"6-piece endgames","volume":"19","author":"thompson","year":"1996","journal-title":"ICCA J"},{"key":"ref18","first-page":"121","article-title":"Temporal difference learning for connect6","author":"wu","year":"2011","journal-title":"Advances in Computer Games (ACG 13)"},{"key":"ref19","first-page":"145","article-title":"An external-memory retrograde analysis algorithm","author":"wu","year":"2004","journal-title":"Proc 4th Int Conf Comput Games (CG 2004)"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/ICG-2010-33204","article-title":"Chinese dark chess","volume":"33","author":"chen","year":"2010","journal-title":"ICGA J"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.11.020"},{"key":"ref6","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref5","first-page":"5","article-title":"Design and implementation of computer chinese dark chess endgame database","author":"chen","year":"2012","journal-title":"Proc TCGA Workshop 2012"},{"key":"ref8","first-page":"89","volume":"2063","author":"van der goot","year":"2001","journal-title":"Awari Retrograde Analysis Computers and Games 2000 (CG2000)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1996.tb00251.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.80"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00152-7"},{"key":"ref20","first-page":"213","article-title":"A memory efficient retrograde algorithm and its application to chinese chess endgame","volume":"42","author":"wu","year":"2002","journal-title":"MSRI Pub"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"230","DOI":"10.3233\/ICG-2010-33410","article-title":"Modark wins chinese dark chess tournament","volume":"33","author":"yen","year":"2010","journal-title":"ICGA J"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/ICG-2004-27102","article-title":"Computer chinese chess","volume":"27","author":"yen","year":"2004","journal-title":"ICGA J"},{"key":"ref24","year":"0"},{"key":"ref23","year":"0"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4804728\/7122941\/06799248.pdf?arnumber=6799248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:41:47Z","timestamp":1642005707000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6799248\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":24,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2014.2317832","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}