{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:48Z","timestamp":1759638228180,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_48","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"670-682","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs"],"prefix":"10.1007","author":[{"given":"Gerold","family":"J\u00e4ger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"issue":"1","key":"48_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/TKDE.2011.147","volume":"25","author":"AU Asuncion","year":"2013","unstructured":"Asuncion, A.U., Goodrich, M.T.: Nonadaptive Mastermind algorithms for string and vector databases, with case studies. IEEE Trans. Knowl. Data Eng. 25(1), 131\u2013144 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"48_CR2","first-page":"105","volume":"20","author":"ST Chen","year":"2004","unstructured":"Chen, S.T., Lin, S.S.: Optimal algorithms for \n                      \n                        \n                      \n                      $$2 \\times n$$\n                     AB games - a graph-partition approach. J. Inf. Sci. Eng. 20(1), 105\u2013126 (2004)","journal-title":"J. Inf. Sci. Eng."},{"issue":"5","key":"48_CR3","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1093\/comjnl\/47.5.602","volume":"47","author":"ST Chen","year":"2004","unstructured":"Chen, S.T., Lin, S.S., Huang, L.T.: Optimal algorithms for \n                      \n                        \n                      \n                      $$2 \\times n$$\n                     Mastermind games - a graph-partition approach. Comput. J. 47(5), 602\u2013611 (2004)","journal-title":"Comput. J."},{"key":"48_CR4","doi-asserted-by":"publisher","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":"48_CR5","doi-asserted-by":"crossref","unstructured":"Doerr, B., Sp\u00f6hel, R., Thomas, H., Winzen, C.: Playing Mastermind with many colors. In: Proceedings of 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), SIAM, pp. 695\u2013704 (2013)","DOI":"10.1137\/1.9781611973105.50"},{"issue":"4","key":"48_CR6","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/s00224-012-9438-8","volume":"55","author":"B Doerr","year":"2014","unstructured":"Doerr, B., Winzen, C.: Playing Mastermind with constant-size memory. Theory Comput. Syst. 55(4), 658\u2013684 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"48_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s00224-011-9340-9","volume":"50","author":"R Focardi","year":"2012","unstructured":"Focardi, R., Luccio, F.L.: Guessing bank PINs by winning a Mastermind game. Theory Comput. Syst. 50(1), 52\u201371 (2012)","journal-title":"Theory Comput. Syst."},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1186\/1471-2105-12-406","volume":"12","author":"J Gagneur","year":"2011","unstructured":"Gagneur, J., Elze, M.C., Tresch, A.: Selective phenotyping, entropy reduction and the Mastermind game. BMC Bioinform. (BMCBI) 12, 406 (2011)","journal-title":"BMC Bioinform. (BMCBI)"},{"key":"48_CR9","first-page":"225","volume":"47","author":"W Goddard","year":"2003","unstructured":"Goddard, W.: Static Mastermind. J. Combin. Math. Combin. Comput. 47, 225\u2013236 (2003)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"48_CR10","first-page":"215","volume":"51","author":"W Goddard","year":"2004","unstructured":"Goddard, W.: Mastermind revisited. J. Combin. Math. Combin. Comput. 51, 215\u2013220 (2004)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"13","key":"48_CR11","doi-asserted-by":"publisher","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. Inf. Process. Lett. 109(13), 675\u2013678 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"12","key":"48_CR12","doi-asserted-by":"publisher","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. Inf. Process. Lett. 109(12), 635\u2013641 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"19","key":"48_CR13","doi-asserted-by":"publisher","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. Inf. Process. Lett. 111(19), 933\u2013940 (2011)","journal-title":"Inf. Process. Lett."},{"key":"48_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-319-19315-1_17","volume-title":"Combinatorial Algorithms","author":"G J\u00e4ger","year":"2015","unstructured":"J\u00e4ger, G., Peczarski, M.: Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 188\u2013199. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-19315-1_17"},{"key":"48_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.dam.2014.10.032","volume":"184","author":"G J\u00e4ger","year":"2015","unstructured":"J\u00e4ger, G., Peczarski, M.: The worst case number of questions in generalized AB game with and without white-peg answers. Discret. Appl. Math. 184, 20\u201331 (2015)","journal-title":"Discret. Appl. Math."},{"key":"48_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2015.06.039","volume":"596","author":"G J\u00e4ger","year":"2015","unstructured":"J\u00e4ger, G., Peczarski, M.: Bounding memory for Mastermind might not make it harder. Theoret. Comput. Sci. 596, 55\u201366 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"48_CR17","first-page":"1","volume":"9","author":"DE Knuth","year":"1976","unstructured":"Knuth, D.E.: The computer as Mastermind. J. Recr. Math. 9, 1\u20136 (1976)","journal-title":"J. Recr. Math."},{"issue":"4","key":"48_CR18","first-page":"251","volume":"25","author":"K Koyama","year":"1993","unstructured":"Koyama, K., Lai, T.W.: An optimal Mastermind strategy. J. Recr. Math. 25(4), 251\u2013256 (1993)","journal-title":"J. Recr. Math."},{"key":"48_CR19","first-page":"25","volume":"5","author":"J Stuckman","year":"2006","unstructured":"Stuckman, J., Zhang, G.Q.: Mastermind is NP-complete. INFOCOMP J. Comput. Sci. 5, 25\u201328 (2006)","journal-title":"INFOCOMP J. Comput. Sci."},{"key":"48_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-30347-0_36","volume-title":"Fun with Algorithms","author":"G Viglietta","year":"2012","unstructured":"Viglietta, G.: Hardness of Mastermind. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 368\u2013378. Springer, Heidelberg (2012)"},{"key":"48_CR21","unstructured":"Source code of the computer program of this article. \n                      http:\/\/snovit.math.umu.se\/~gerold\/source_code_static_mastermind.tar.gz"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:19:45Z","timestamp":1558477185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/cocoa2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}