{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:17:46Z","timestamp":1742930266274,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996592"},{"type":"electronic","value":"9783319996608"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-99660-8_25","type":"book-chapter","created":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T18:19:21Z","timestamp":1535307561000},"page":"261-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs"],"prefix":"10.1007","author":[{"given":"Gerold","family":"J\u00e4ger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Drewes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"25_CR1","volume-title":"Theory and Applications of Distance Geometry","author":"LM Blumenthal","year":"1953","unstructured":"Blumenthal, L.M.: Theory and Applications of Distance Geometry. Clarendon Press, Oxford (1953)"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/050641867","volume":"21","author":"J C\u00e1ceres","year":"2007","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of cartesian products of graphs. SIAM J. Discrete Math. 21(2), 423\u2013441 (2007)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"25_CR3","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":"25_CR4","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":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-71147-8_28","volume-title":"Combinatorial Optimization and Applications","author":"C Glazik","year":"2017","unstructured":"Glazik, C., J\u00e4ger, G., Schiemann, J., Srivastav, A.: Bounds for static black-peg AB mastermind. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 409\u2013424. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_28"},{"key":"25_CR6","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":"25_CR7","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."},{"issue":"13","key":"25_CR8","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."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-319-48749-6_48","volume-title":"Combinatorial Optimization and Applications","author":"G J\u00e4ger","year":"2016","unstructured":"J\u00e4ger, G.: An optimal strategy for static black-peg mastermind with two pegs. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 670\u2013682. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48749-6_48"},{"issue":"12","key":"25_CR10","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":"25_CR11","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":"25_CR12","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. Discrete Appl. Math. 184, 20\u201331 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1080\/00029890.1963.11992174","volume":"70","author":"S S\u00f6derberg","year":"1963","unstructured":"S\u00f6derberg, S., Shapiro, H.S.: A combinatory detection problem. Am. Math. Mon. 70(10), 1066\u20131070 (1963)","journal-title":"Am. Math. Mon."},{"key":"25_CR14","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":"25_CR15","unstructured":"Source code of the computer program of this article. http:\/\/snovit.math.umu.se\/~gerold\/source_code_static_black_peg_mastermind_three_pegs.tar.gz"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99660-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:42:11Z","timestamp":1709833331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99660-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319996592","9783319996608"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99660-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aims.sjtu.edu.cn\/SAGT_2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}