{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:49:26Z","timestamp":1742982566730,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876076"},{"type":"electronic","value":"9783540876083"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87608-3_23","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T11:35:11Z","timestamp":1222169711000},"page":"252-263","source":"Crossref","is-referenced-by-count":1,"title":["A Retrograde Approximation Algorithm for Multi-player Can\u2019t Stop"],"prefix":"10.1007","author":[{"given":"James","family":"Glenn","sequence":"first","affiliation":[]},{"given":"Haw-ren","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Clyde P.","family":"Kruskal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, 3rd edn., vol.\u00a0I. Athena Scientific (2005)"},{"key":"23_CR2","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, 3rd edn., vol.\u00a0II. Athena Scientific (2007)"},{"key":"23_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780195300574.001.0001","volume-title":"Playing for Real: A Text on Game Theory","author":"K. Binmore","year":"2007","unstructured":"Binmore, K.: Playing for Real: A Text on Game Theory. Oxford University Press, USA (2007)"},{"key":"23_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis","year":"1996","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations, USA, SIAM, Philadelphia (1996)"},{"issue":"2","key":"23_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.3233\/ICG-2008-31203","volume":"31","author":"H.-r. Fang","year":"2008","unstructured":"Fang, H.-r., Glenn, J., Kruskal, C.P.: Retrograde approximation algorithms for jeopardy stochastic games. ICGA Journal\u00a031(2), 77\u201396 (2008)","journal-title":"ICGA Journal"},{"key":"23_CR6","unstructured":"Glenn, J.: An optimal strategy for Yahtzee. Technical Report CS-TR-0002, Loyola College in Maryland, 4501 N. Charles St, Baltimore MD 21210, USA (May 2006)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Glenn, J.: Computer strategies for solitaire yahtzee. In: IEEE Symposium on Computational Intelligence and Games (CIG 2007), pp. 132\u2013139 (2007)","DOI":"10.1109\/CIG.2007.368089"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-75538-8_13","volume-title":"Computer and Games (CG 2006)","author":"J. Glenn","year":"2007","unstructured":"Glenn, J., Fang, H.-r., Kruskal, C.P.: A retrograde approximate algorithm for one-player Can\u2019t Stop. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 148\u2013159. Springer, Heidelberg (2007)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Glenn, J., Fang, H.-r., Kruskal, C.P.: A retrograde approximate algorithm for two-player Can\u2019t Stop. In: Glenn, J. (ed.) CGW 2007 Workshop, Amsterdam, The Netherlands, pp. 145\u2013156 (2007)","DOI":"10.1007\/978-3-540-75538-8_13"},{"issue":"1\u20132","key":"23_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0004-3702(01)00152-7","volume":"134","author":"H.J. van den Herik","year":"2002","unstructured":"van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijck, J.: Games solved: Now and in the future. Artificial Intelligence\u00a0134(1\u20132), 277\u2013311 (2002)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"23_CR11","first-page":"25","volume":"25","author":"T. Neller","year":"2004","unstructured":"Neller, T., Presser, C.: Optimal play of the dice game Pig. The UMAP Journal\u00a025(1), 25\u201347 (2004)","journal-title":"The UMAP Journal"},{"issue":"10","key":"23_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.2003.1236468","volume":"36","author":"J.W. Romein","year":"2003","unstructured":"Romein, J.W., Bal, H.E.: Solving the game of Awari using parallel retrograde analysis. IEEE Computer\u00a036(10), 26\u201333 (2003)","journal-title":"IEEE Computer"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-0-387-35706-5_13","volume-title":"Advances in Computer Games 10. Many Games, Many Challenges","author":"J. Schaeffer","year":"2004","unstructured":"Schaeffer, J., Bj\u00f6rnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the checkers 10-piece endgame databases. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games 10. Many Games, Many Challenges, USA,, pp. 193\u2013210. Kluwer Academic Publishers, Boston (2004)"},{"issue":"1","key":"23_CR14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1080\/09332480.2003.10554833","volume":"16","author":"P. Woodward","year":"2003","unstructured":"Woodward, P.: Yahtzee: The solution. Chance\u00a016(1), 18\u201322 (2003)","journal-title":"Chance"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87608-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:51:17Z","timestamp":1715313077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87608-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876076","9783540876083"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87608-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}