{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T14:20:14Z","timestamp":1751466014362},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642205248"},{"type":"electronic","value":"9783642205255"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20525-5_11","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T03:01:54Z","timestamp":1303873314000},"page":"103-112","source":"Crossref","is-referenced-by-count":7,"title":["Improving and Scaling Evolutionary Approaches to the MasterMind Problem"],"prefix":"10.1007","author":[{"given":"Juan J.","family":"Merelo","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Cotta","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Mora","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/298151.298360","volume-title":"1999 ACM Symposium on Applied Computing","author":"L. Bento","year":"1999","unstructured":"Bento, L., Pereira, L., Rosa, A.C.: Mastermind by evolutionary algorithms. In: 1999 ACM Symposium on Applied Computing, pp. 307\u2013311. ACM, New York (1999)"},{"issue":"6","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1016\/j.cor.2008.06.004","volume":"36","author":"L. Berghman","year":"2009","unstructured":"Berghman, L., Goossens, D., Leus, R.: Efficient solutions for Mastermind using genetic algorithms. Computers and Operations Research\u00a036(6), 1880\u20131885 (2009)","journal-title":"Computers and Operations Research"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/3-540-61723-X_1019","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"J.L. Bernier","year":"1996","unstructured":"Bernier, J.L., Herr\u00e1iz, C.I., Merelo-Guerv\u00f3s, J.J., Olmeda, S., Prieto, A.: MasterMind using GAs and simulated annealing: a case of dynamic constraint optimization. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN IV 1996. LNCS, vol.\u00a01141, pp. 553\u2013563. Springer, Heidelberg (1996)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/00221300009598576","volume":"127","author":"J. Best","year":"2000","unstructured":"Best, J.: The role of context on strategic actions in mastermind. The Journal of General Psychology\u00a0127(2), 165\u2013177 (2000)","journal-title":"The Journal of General Psychology"},{"key":"11_CR5","unstructured":"Bestavros, A., Belal, A.: Mastermind, a game of diagnosis strategies. Bulletin of the Faculty of Engineering, Alexandria University (December 1986), \n                    \n                      http:\/\/citeseer.ist.psu.edu\/bestavros86mastermind.html"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1093\/comjnl\/bxm006","volume":"50","author":"S.T. Chen","year":"2007","unstructured":"Chen, S.T., Lin, S.S., Huang, L.T.: A two-phase optimization algorithm for mastermind. Computer Journal\u00a050(4), 435\u2013443 (2007)","journal-title":"Computer Journal"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","first-page":"421","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"C. Cotta","year":"2010","unstructured":"Cotta, C., Merelo Guerv\u00f3s, J., Mora Garc\u00eda, A., Runarsson, T.: Entropy-driven evolutionary approaches to the mastermind problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06239, pp. 421\u2013431. Springer, Heidelberg (2010)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-13122-6_21","volume-title":"Fun with Algorithms","author":"R. Focardi","year":"2010","unstructured":"Focardi, R., Luccio, F.: Cracking bank pins by playing mastermind. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol.\u00a06099, pp. 202\u2013213. Springer, Heidelberg (2010)"},{"issue":"13","key":"11_CR9","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.ipl.2009.02.021","volume":"109","author":"M. Goodrich","year":"2009","unstructured":"Goodrich, M.: On the algorithmic complexity of the Mastermind game with black-peg results. Information Processing Letters\u00a0109(13), 675\u2013678 (2009)","journal-title":"Information Processing Letters"},{"issue":"2","key":"11_CR10","first-page":"81","volume":"11","author":"R.W. Irving","year":"1978","unstructured":"Irving, R.W.: Towards an optimum Mastermind strategy. Journal of Recreational Mathematics\u00a011(2), 81\u201387 (1978-1979)","journal-title":"Journal of Recreational Mathematics"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1007\/3-540-45110-2_39","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"T. Kalisker","year":"2003","unstructured":"Kalisker, T., Camens, D.: Solving Mastermind using genetic algorithms. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1590\u20131591. Springer, Heidelberg (2003)"},{"issue":"1","key":"11_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/ICG-2008-31103","volume":"31","author":"G. Kendall","year":"2008","unstructured":"Kendall, G., Parkes, A., Spoerer, K.: A survey of NP-complete puzzles. ICGA Journal\u00a031(1), 13\u201334 (2008)","journal-title":"ICGA Journal"},{"issue":"1","key":"11_CR13","first-page":"1","volume":"9","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: The computer as Master Mind. J. Recreational Mathematics\u00a09(1), 1\u20136 (1976)","journal-title":"J. Recreational Mathematics"},{"issue":"1","key":"11_CR14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/ICG-2005-28105","volume":"28","author":"B. Kooi","year":"2005","unstructured":"Kooi, B.: Yet another Mastermind strategy. ICGA Journal\u00a028(1), 13\u201320 (2005)","journal-title":"ICGA Journal"},{"key":"11_CR15","unstructured":"Merelo, J.J.: Genetic Mastermind, a case of dynamic constraint optimization (1996), GeNeura Technical Report G-96-1, Universidad de Granada"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Merelo, J., Mora, A., Runarsson, T., Cotta, C.: Assessing efficiency of different evolutionary strategies playing mastermind. In: 2010 IEEE Symposium on Computational Intelligence and Games (CIG), pp. 38\u201345 (August 2010)","DOI":"10.1109\/ITW.2010.5593373"},{"key":"11_CR17","unstructured":"Merelo, J.J., Mora, A., Castillo, P., Laredo, J.L.J., Fernandes, C.: Optimizing evolutionary algorithms at program level. In: Proceedings META 2010, International Conference on Metaheuristics and Nature Inspired Computing (October 2010)"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.asoc.2004.09.003","volume":"6","author":"J.J. Merelo-Guerv\u00f3s","year":"2006","unstructured":"Merelo-Guerv\u00f3s, J.J., Castillo, P., Rivas, V.: Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary MasterMind. Applied Soft Computing\u00a06(2), 170\u2013179 (2006)","journal-title":"Applied Soft Computing"},{"issue":"8","key":"11_CR19","first-page":"257","volume":"Serie B 26","author":"E. Neuwirth","year":"1982","unstructured":"Neuwirth, E.: Some strategies for Mastermind. Zeitschrift fur Operations Research\u00a0Serie B 26(8), B257\u2013B278 (1982)","journal-title":"Zeitschrift fur Operations Research"},{"key":"11_CR20","series-title":"SCI","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-12538-6_22","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)","author":"T.P. Runarsson","year":"2010","unstructured":"Runarsson, T.P., Merelo-Guerv\u00f3s, J.J.: Adapting heuristic Mastermind strategies to evolutionary algorithms. In: Gonz\u00e1lez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) NICSO 2010. SCI, vol.\u00a0284, pp. 255\u2013267. Springer, Heidelberg (2010)"},{"key":"11_CR21","first-page":"25","volume":"5","author":"J. Stuckman","year":"2006","unstructured":"Stuckman, J., Zhang, G.Q.: Mastermind is NP-complete. INFOCOMP J. Comput. Sci.\u00a05, 25\u201328 (2006), \n                    \n                      http:\/\/arxiv.org\/abs\/cs\/0512049","journal-title":"INFOCOMP J. Comput. Sci."},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-30217-9_28","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"F.F. Vega de","year":"2004","unstructured":"de Vega, F.F., Cant\u00fa-Paz, E., L\u00f3pez, J.I., Manzano, T.: Saving resources with plagues in genetic algorithms. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P., et al. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 272\u2013281. Springer, Heidelberg (2004)"},{"key":"11_CR23","unstructured":"Weisstein, E.W.: Mastermind. From MathWorld\u2013A Wolfram Web Resource, \n                    \n                      http:\/\/mathworld.wolfram.com\/Mastermind.html"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20525-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:09:41Z","timestamp":1558573781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20525-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642205248","9783642205255"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20525-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}