{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T13:24:05Z","timestamp":1743427445868},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205456"},{"type":"electronic","value":"9783540400318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40031-8_18","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:50Z","timestamp":1283727830000},"page":"264-279","source":"Crossref","is-referenced-by-count":3,"title":["Indefinite Sequence of Moves in Chinese Chess Endgames"],"prefix":"10.1007","author":[{"given":"Haw-ren","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsan-sheng","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shun-chin","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"215","volume":"19","author":"K. Thompson","year":"1996","unstructured":"Thompson, K.: 6-piece endgames. International Computer Chess Association Journal\u00a019, 215\u2013226 (1996)","journal-title":"International Computer Chess Association Journal"},{"key":"18_CR2","unstructured":"China Xiangqi Association: The Playing Rules of Chinese Chess. Shanghai Lexicon Publishing Company (1999) (in Chinese)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-45579-5_7","volume-title":"Computers and Games","author":"H. Fang","year":"2002","unstructured":"Fang, H., Hsu, T., Hsu, S.: Construction of Chinese chess endgame databases by retrograde analysis. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol.\u00a02063, pp. 96\u2013114. Springer, Heidelberg (2002)"},{"key":"18_CR4","first-page":"147","volume":"24","author":"R. Wu","year":"2001","unstructured":"Wu, R., Beal, D.: Fast, memory-efficient retrograde algorithms. International Computer Chess Association Journal\u00a024, 147\u2013159 (2001)","journal-title":"International Computer Chess Association Journal"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0004-3702(01)00152-7","volume":"134","author":"J. Herik van den","year":"2002","unstructured":"van den Herik, J., Uiterwijk, J., van Rijswijck, J.: Games solved: Now and in the future. Artificial Intelligence\u00a0134, 277\u2013311 (2002)","journal-title":"Artificial Intelligence"},{"key":"18_CR6","first-page":"81","volume":"22","author":"E. Heinz","year":"1999","unstructured":"Heinz, E.: Knowledgeable encoding and querying of endgame databases. International Computer Chess Association Journal\u00a022, 81\u201397 (1999)","journal-title":"International Computer Chess Association Journal"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40031-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T01:41:42Z","timestamp":1553046102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40031-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205456","9783540400318"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40031-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}