{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:26:38Z","timestamp":1725891998568},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642371912"},{"type":"electronic","value":"9783642371929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37192-9_31","type":"book-chapter","created":{"date-parts":[[2013,3,4]],"date-time":"2013-03-04T21:05:39Z","timestamp":1362431139000},"page":"304-313","source":"Crossref","is-referenced-by-count":3,"title":["Comparing Evolutionary Algorithms to Solve the Game of MasterMind"],"prefix":"10.1007","author":[{"given":"Javier","family":"Maestro-Montojo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Juli\u00e1n","family":"Merelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sancho","family":"Salcedo-Sanz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","first-page":"1","volume":"9","author":"E. Knuth","year":"1977","unstructured":"Knuth, E.: The computer as Master Mind. Journal of Recreational Mathematics\u00a09, 1\u20136 (1977)","journal-title":"Journal of Recreational Mathematics"},{"issue":"2","key":"31_CR2","first-page":"81","volume":"11","author":"W. Irving","year":"1979","unstructured":"Irving, W.: Towards an optimum Mastermind strategy. Journal of Recreational Mathematics\u00a011(2), 81\u201387 (1979)","journal-title":"Journal of Recreational Mathematics"},{"issue":"4","key":"31_CR3","first-page":"251","volume":"25","author":"K. Koyama","year":"1993","unstructured":"Koyama, K., Lai, T.: An optimal Mastermind strategy. Journal of Recrational Mathematics\u00a025(4), 251\u2013256 (1993)","journal-title":"Journal of Recrational Mathematics"},{"key":"31_CR4","volume-title":"Bulletin of the Faculty of Engineering","author":"A. Bestavros","year":"1986","unstructured":"Bestavros, A., Belal, A.: Master Mind: a game of diagnosis strategies. In: Bulletin of the Faculty of Engineering, Alexandria University, Alexandria (1986)"},{"issue":"1","key":"31_CR5","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"},{"issue":"4","key":"31_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. The Computer Journal\u00a050(4), 435\u2013443 (2007)","journal-title":"The Computer Journal"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.ejor.2006.08.058","volume":"183","author":"S.T. Chen","year":"2007","unstructured":"Chen, S.T., Lin, S., Huang, L., Hsu, S.: Strategy optimization for deductive games. European Journal of Operational Research\u00a0183, 757\u2013766 (2007)","journal-title":"European Journal of Operational Research"},{"unstructured":"Merelo, J.J., Mora, A.M., Cotta, C., Runarsson, T.P.: An experimental study of exhaustive solutions for the Mastermind puzzle. ARXiV (2012)","key":"31_CR8"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1056635.1056637","volume":"85","author":"E. Shapiro","year":"1983","unstructured":"Shapiro, E.: Playing Mastermind logically. SIGART Bulleting\u00a085, 28\u201329 (1983)","journal-title":"SIGART Bulleting"},{"key":"31_CR10","first-page":"130","volume":"30","author":"P. Swaszek","year":"2000","unstructured":"Swaszek, P.: The mastermind novice. Journal of Recreational Mathematics\u00a030, 130\u2013138 (2000)","journal-title":"Journal of Recreational Mathematics"},{"unstructured":"Temporal, A., Kovacs, T.: A heuristic hill climbing algorithm for Mastermind. In: Proc. of the UK Workshop on Computational Intelligence, Bristol, UK, pp. 183\u2013196 (2003)","key":"31_CR11"},{"doi-asserted-by":"crossref","unstructured":"Bernier, J., Herr\u00e1iz, C., Merelo-Guerv\u00f3s, J.J., Olmeda, S., Prieto, A.: Solving Mastermind using GAs and simulated annealing: a case of dynamic constraint optimization. In: Proc. of the 4th International Conference on Parallel Problem Solving from Nature, London, UK, pp. 554\u2013563 (1996)","key":"31_CR12","DOI":"10.1007\/3-540-61723-X_1019"},{"doi-asserted-by":"crossref","unstructured":"Bento, L., Pereira, L., Rosa, A.: Mastermind by evolutionary algorithms. In: Proc. of the Sixth Annual Workshop on Selected Areas in Cryptography, Kingston, Ontario, Canada, pp. 307\u2013311 (1999)","key":"31_CR13","DOI":"10.1145\/298151.298360"},{"key":"31_CR14","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. Kalister","year":"2003","unstructured":"Kalister, T., Camens, D.: Solving Mastermind using Genetic Algorithms. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1590\u20131591. Springer, Heidelberg (2003)"},{"issue":"2","key":"31_CR15","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"},{"unstructured":"Some A. Uthor, A fine paper (2012)","key":"31_CR16"},{"issue":"6","key":"31_CR17","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1016\/j.cor.2008.06.004","volume":"36","author":"L. Bergman","year":"2009","unstructured":"Bergman, L., Goossens, D., Leus, R.: Efficient solutions for Mastermind using genetic algorithms. Computers & Operations Research\u00a036(6), 1880\u20131885 (2009)","journal-title":"Computers & Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Runarsson, T.P., Merelo-Guervos, J.J.: Adapting heuristic Mastermind strategies to evolutionary algorithms. In: Proc. of the International Workshop on Nature Inspired Cooperative Strategies for Optimization, Granada, Spain (2010)","key":"31_CR18","DOI":"10.1007\/978-3-642-12538-6_22"}],"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-37192-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T10:38:59Z","timestamp":1557571139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37192-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642371912","9783642371929"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37192-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}