{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:17:33Z","timestamp":1757621853231,"version":"3.44.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032002808"},{"type":"electronic","value":"9783032002815"}],"license":[{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-00281-5_10","type":"book-chapter","created":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:28Z","timestamp":1754825908000},"page":"149-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of\u00a0Solo Chess with\u00a0Unlimited Moves"],"prefix":"10.1007","author":[{"given":"Josh","family":"Brunner","sequence":"first","affiliation":[]},{"given":"Lily","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Coulombe","sequence":"additional","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Timothy","family":"Gomez","sequence":"additional","affiliation":[]},{"given":"Jayson","family":"Lynch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"10_CR1","unstructured":"Aravind, N.R., Misra, N., Mittal, H.: Chess is hard even for a single player. In: Fraigniaud, P., Uno, Y. (eds.) Proceedings of the 11th International Conference on Fun with Algorithms, vol. 226 of LIPIcs, pp. 5:1\u20135:20 (2022)"},{"key":"10_CR2","unstructured":"Brunner, J., Demaine, E.D., Hendrickson, D.H., Wellman, J.: Complexity of retrograde and helpmate chess problems: even cooperative chess is hard. In: Cao, Y., Cheng, S.-W., Li, M. (eds.) Proceedings of the 31st International Symposium on Algorithms and Computation, vol. 181 of LIPIcs, pp. 17:1\u201317:14 (2020)"},{"key":"10_CR3","unstructured":"Chess.com. Solo chess. https:\/\/www.chess.com\/solo-chess"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"de\u00a0Berg, M., Khosravi, A.: Optimal binary space partitions in the plane. In: Thai, M.T., Sahni, S. (eds.) Computing and Combinatorics, pp. 216\u2013225, Berlin, Heidelberg (2010). Springer Berlin Heidelberg","DOI":"10.1007\/978-3-642-14031-0_25"},{"key":"10_CR5","first-page":"233","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Nat. Bureau Stand. B 71, 233\u2013240 (1967)","journal-title":"J. Res. Nat. Bureau Stand. B"},{"key":"10_CR6","unstructured":"Filho, I.T.F.A.: Characterizing Boolean satisfiability variants. M.eng.\u00a0thesis, Massachusetts Institute of Technology (2019)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","volume":"31","author":"AS Fraenkel","year":"1981","unstructured":"Fraenkel, A.S., Lichtenstein, D.: Computing a perfect strategy for $$n \\times n$$ chess requires time exponential in $$n$$. J. Comb. Theory Ser. A 31, 199\u2013214 (1981)","journal-title":"J. Comb. Theory Ser. A"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Galil, Z., Spencer, T.H., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2), 109\u2013122 (1986)","DOI":"10.1007\/BF02579168"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","DOI":"10.1137\/0211056"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discret. Math. 5(3), 422\u2013427 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"10_CR11","unstructured":"Korte, B., Vygen, J.: Spanning trees and arborescences. In: Combinatorial Optimization: Theory and Algorithms, pp. 119\u2013141. Springer (2006)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the travelling salesman problem. J. Algorithms 5(2), 231\u2013246 (1984)","journal-title":"J. Algorithms"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0022-0000(83)90030-2","volume":"27","author":"JA Storer","year":"1983","unstructured":"Storer, J.A.: On the complexity of chess. J. Comput. Syst. Sci. 27(1), 77\u2013100 (1983)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discret. Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00281-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T15:57:58Z","timestamp":1757347078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00281-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,11]]},"ISBN":["9783032002808","9783032002815"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00281-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/JCDCGG\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}