{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T06:39:50Z","timestamp":1721025590810},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/j.tcs.2003.02.001","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T06:59:35Z","timestamp":1070434775000},"page":"325-338","source":"Crossref","is-referenced-by-count":10,"title":["Solitaire Clobber"],"prefix":"10.1016","volume":"313","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Fleischer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2003.02.001_BIB1","unstructured":"E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways for Your Mathematical Plays, Vol. 1, 2nd ed., A.K. Peters, Ltd., Wellesley, MA, 2001."},{"key":"10.1016\/j.tcs.2003.02.001_BIB2","unstructured":"E.D. Demaine, R. Fleischer, A. Fraenkel, R. Nowakowski (organizers), Dagstuhl Seminar on Algorithmic Combinatorial Game Theory, Seminar No. 02081, Report No. 334, March 17\u201322, 2002."},{"key":"10.1016\/j.tcs.2003.02.001_BIB3","unstructured":"T. Gottfried, Clobber, 2002, http:\/\/gottfriedville.net\/games\/clobber\/index.htm"},{"key":"10.1016\/j.tcs.2003.02.001_BIB4","unstructured":"J.P. Grossmann, private communication, March 2002."},{"issue":"4","key":"10.1016\/j.tcs.2003.02.001_BIB5","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2003.02.001_BIB6","unstructured":"R. Nowakowski, private communication, December 2002."},{"key":"10.1016\/j.tcs.2003.02.001_BIB7","unstructured":"D. Wolfe, Clobber research, 2002, http:\/\/www.gac.edu\/~wolfe\/games\/clobber"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503005863?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503005863?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T09:58:32Z","timestamp":1550311112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503005863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0304397503005863"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2003.02.001","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}