{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:25:09Z","timestamp":1742912709341,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_17","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"188-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory"],"prefix":"10.1007","author":[{"given":"Gerold","family":"J\u00e4ger","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Peczarski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"issue":"1","key":"17_CR1","first-page":"105","volume":"20","author":"ST Chen","year":"2004","unstructured":"Chen, S.T., Lin, S.S.: Optimal algorithms for $$2 \\times n$$ AB games\u2013a graph-partition approach. J. Inform. Sci. Eng. 20(1), 105\u2013126 (2004)","journal-title":"J. Inform. Sci. Eng."},{"issue":"5","key":"17_CR2","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.: Optimal algorithms for $$2 \\times n$$ Mastermind games\u2013a graph-partition approach. Comput. J. 47(5), 602\u2013611 (2004)","journal-title":"Comput. J."},{"issue":"3\u20134","key":"17_CR3","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(3\u20134), 325\u2013329 (1983)","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Sp\u00f6hel, R., Thomas, H., Winzen, C.: Playing mastermind with many colors. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), SIAM, pp. 695\u2013704 (2013)","key":"17_CR4","DOI":"10.1137\/1.9781611973105.50"},{"issue":"1\u20132","key":"17_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ipl.2011.10.004","volume":"112","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Winzen, C.: Memory-restricted black-box complexity of OneMax. Inform. Process. Lett. 112(1\u20132), 32\u201334 (2012)","journal-title":"Inform. Process. Lett."},{"unstructured":"Doerr, B., Winzen, C.: Playing Mastermind with constant-size memory. In: Proceedings of 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), vol. 14, pp. 441\u2013452. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012)","key":"17_CR6"},{"issue":"4","key":"17_CR7","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":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory Comput. Syst. 39(4), 525\u2013544 (2006)","journal-title":"Theory Comput. Syst."},{"unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On two problems of information theory. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8, 229\u2013243 (1963)","key":"17_CR9"},{"key":"17_CR10","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."},{"issue":"13","key":"17_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. Inform. Process. Lett. 109(13), 675\u2013678 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"12","key":"17_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. Inform. Process. Lett. 109(12), 635\u2013641 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"19","key":"17_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. Inform. Process. Lett. 111(19), 933\u2013940 (2011)","journal-title":"Inform. Process. Lett."},{"key":"17_CR14","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."},{"unstructured":"Knuth, D.E.: The computer as Mastermind. J. Recr. Math. 9(1), 1\u20136 (1976\u20131977)","key":"17_CR15"},{"issue":"4","key":"17_CR16","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."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:05:51Z","timestamp":1675137951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}