{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:59:11Z","timestamp":1740095951493,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642125379"},{"type":"electronic","value":"9783642125386"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12538-6_22","type":"book-chapter","created":{"date-parts":[[2010,4,16]],"date-time":"2010-04-16T05:35:14Z","timestamp":1271396114000},"page":"255-267","source":"Crossref","is-referenced-by-count":11,"title":["Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Thomas Philip","family":"Runarsson","sequence":"first","affiliation":[]},{"given":"Juan J.","family":"Merelo-Guerv\u00f3s","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"22_CR1","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), \n                  \n                    http:\/\/www.scopus.com\/inward\/record.url?eid=2-s2.0-56549123376&partnerID=40","journal-title":"Computers and Operations Research"},{"key":"22_CR2","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.: Solving masterm\n                ind using GAs and simulated annealing: a case of dynamic constraint optimization. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol.\u00a01141, pp. 553\u2013563. Springer, Heidelberg (1996) \n                  \n                    http:\/\/www.springerlink.com\/content\/78j7430828t2867g"},{"key":"22_CR3","unstructured":"Bestavros, A., Belal, A.: Mastermind, a game of diagnosis strategies. Bulletin of the Faculty of Engineering. Alexandria University (1986), \n                  \n                    citeseer.ist.psu.edu\/bestavros86mastermind.html\n                  \n                  \n                , \n                  \n                    http:\/\/www.cs.bu.edu\/fac\/best\/res\/papers\/alybull86.ps"},{"issue":"2","key":"22_CR4","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"},{"issue":"1","key":"22_CR5","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), \n                  \n                    http:\/\/www.scopus.com\/inward\/record.url?eid=2-s2.0-42949163946&partnerID=40\n                  \n                  \n                 (Cited By (Since 1996) 1)","journal-title":"ICGA Journal"},{"issue":"1","key":"22_CR6","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-1977)","journal-title":"J. Recreational Mathematics"},{"issue":"1","key":"22_CR7","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), \n                  \n                    http:\/\/www.scopus.com\/inward\/record.url?eid=2-s2.0-33646756877&partnerID=40","journal-title":"ICGA Journal"},{"key":"22_CR8","unstructured":"Koyama, K., Lai, T.W.: An optimal Mastermind strategy. J. Recreational Mathematics\u00a025(4) (1993\/1994)"},{"key":"22_CR9","unstructured":"Merelo-Guerv\u00f3s, J.J., Carpio, J., Castillo, P., Rivas, V.M., Romero, G.: Finding a needle in a haystack using hints and evolutionary computation: the case of genetic mastermind. In: Scott Brave, A.S.W. (ed.) Late breaking papers at the GECCO 1999, pp. 184\u2013192 (1999)"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.asoc.2004.09.003","volume":"6","author":"J. Merelo-Guerv\u00f3s","year":"2006","unstructured":"Merelo-Guerv\u00f3s, 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), \n                  \n                    http:\/\/www.sciencedirect.com\/science\/article\/B6W86-4FH0D6P-1\/2\/40a99afa8e9c7734baae340abecc113a\n                  \n                  \n                , \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.asoc.2004.09.003","journal-title":"Applied Soft Computing"},{"key":"22_CR11","unstructured":"Merelo-Guerv\u00f3s, J.J., Castillo, P.A., Alba, E.: ALGORITHM::EVOLUTIONARY, a flexible Perl module for evolutionary computation. Soft Computing - A Fusion of Foundations, Methodologies and Applications (2010), doi 10.1007\/s00500-009-0504-3, \n                  \n                    http:\/\/www.springerlink.com\/content\/8h025g83j0q68270"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"H. M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein, H., Paass, G.: From recombination of genes to the estimation of distributions: I. binary parameters. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol.\u00a01141, pp. 178\u2013187. Springer, Heidelberg (1996)"},{"issue":"8","key":"22_CR13","first-page":"257","volume":"26","author":"E. Neuwirth","year":"1982","unstructured":"Neuwirth, E.: Some strategies for mastermind. Zeitschrift fur Operations Research. Serie B\u00a026(8), B257\u2013B278 (1982)","journal-title":"Zeitschrift fur Operations Research. Serie B"},{"key":"22_CR14","unstructured":"Stuckman, J., Zhang, G.Q.: Mastermind is np-complete. CoRR abs\/cs\/0512049 (2005)"},{"key":"22_CR15","unstructured":"Wikipedia: Mastermind (board game) \u2014 Wikipedia, The Free Encyclopedia (2009), \n                  \n                    http:\/\/en.wikipedia.org\/w\/index.php?title=Mastermind_board_game&oldid=317686771\n                  \n                  \n                 (Online: accessed October 9, 2009)"}],"container-title":["Studies in Computational Intelligence","Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12538-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:42:53Z","timestamp":1619782973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12538-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642125379","9783642125386"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12538-6_22","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2010]]}}}