{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:21:31Z","timestamp":1725873691405},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319509341"},{"type":"electronic","value":"9783319509358"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50935-8_11","type":"book-chapter","created":{"date-parts":[[2016,12,9]],"date-time":"2016-12-09T08:50:32Z","timestamp":1481273432000},"page":"115-128","source":"Crossref","is-referenced-by-count":4,"title":["Nash Equilibrium in Mastermind"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Viennot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,10]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1093\/comjnl\/47.5.602","volume":"47","author":"ST Chen","year":"2004","unstructured":"Chen, S.T., Lin, S.S.: Optimal algorithms for $$2\\times n$$ mastermind games-a graph-partition approach. Comput. J. 47, 602\u2013611 (2004)","journal-title":"Comput. J."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02579188","volume":"3","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Mastermind. Combinatorica 3, 325\u2013329 (1983)","journal-title":"Combinatorica"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Doerr, B., Sphel, R., Thomas, H., Winzen, C.: Playing mastermind with many colors. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 695\u2013704 (2013)","DOI":"10.1137\/1.9781611973105.50"},{"key":"11_CR4","first-page":"225","volume":"47","author":"W Goddard","year":"2003","unstructured":"Goddard, W.: Static mastermind. J. Comb. Math. Comb. Comput. 47, 225\u2013236 (2003)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"11_CR5","first-page":"215","volume":"51","author":"W Goddard","year":"2004","unstructured":"Goddard, W.: Mastermind revisited. J. Comb. Math. Comb. Comput. 51, 215\u2013220 (2004)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.ipl.2009.02.021","volume":"109","author":"MT Goodrich","year":"2009","unstructured":"Goodrich, M.T.: On the algorithmic complexity of the mastermind game with black-peg results. Inform. Process. Lett. 109, 675\u2013678 (2009)","journal-title":"Inform. Process. Lett."},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.ipl.2009.02.016","volume":"109","author":"G J\u00e4ger","year":"2009","unstructured":"J\u00e4ger, G., Peczarski, M.: The number of pessimistic guesses in generalized mastermind. Inform. Process. Lett. 109, 635\u2013641 (2009)","journal-title":"Inform. Process. Lett."},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1016\/j.ipl.2011.06.009","volume":"111","author":"G J\u00e4ger","year":"2011","unstructured":"J\u00e4ger, G., Peczarski, M.: The number of pessimistic guesses in generalized black-peg mastermind. Inform. Process. Lett. 111, 933\u2013940 (2011)","journal-title":"Inform. Process. Lett."},{"key":"11_CR9","first-page":"1","volume":"9","author":"DE Knuth","year":"1976","unstructured":"Knuth, D.E.: The computer as master mind. J. Recreational Math. 9, 1\u20136 (1976)","journal-title":"J. Recreational Math."},{"key":"11_CR10","first-page":"251","volume":"25","author":"K Koyama","year":"1993","unstructured":"Koyama, K., Lai, T.: An optimal mastermind strategy. J. Recreational Math. 25, 251\u2013256 (1993)","journal-title":"J. Recreational Math."},{"key":"11_CR11","unstructured":"Nash, J.F.: Non-Cooperative Games. Ph.D. thesis, Princeton University (1950)"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1017\/S1446788700018279","volume":"33","author":"KR Pearson","year":"1982","unstructured":"Pearson, K.R.: Reducing two person, zero sum games with underlying symmetry. J. Aust. Math. Soc. (Ser. A) 33, 152\u2013161 (1982)","journal-title":"J. Aust. Math. Soc. (Ser. A)"},{"key":"11_CR13","unstructured":"Ville, G.: An optimal mastermind $$(4,7)$$ strategy and more results in the expected case, May 2013, eprint arXiv:1305.1010"},{"key":"11_CR14","unstructured":"Wiener, M.: Re: sci.math faq: Master mind, post in sci.math newsgroups on 29 Nov 1995 at 20: 44: 49"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50935-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:34:54Z","timestamp":1498368894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50935-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319509341","9783319509358"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50935-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}