{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T14:20:48Z","timestamp":1751466048718},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T00:00:00Z","timestamp":1386720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s12065-013-0099-6","type":"journal-article","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T04:27:55Z","timestamp":1386649675000},"page":"219-228","source":"Crossref","is-referenced-by-count":6,"title":["New solver and optimal anticipation strategies design based on evolutionary computation for the game of MasterMind"],"prefix":"10.1007","volume":"6","author":[{"given":"J.","family":"Maestro-Montojo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Salcedo-Sanz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. J.","family":"Merelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,11]]},"reference":[{"key":"99_CR1","unstructured":"Focardi R, Luccio F (2011) Guessing bank pins by winning a mastermind game. Theory Comput Syst 1\u201320"},{"key":"99_CR2","doi-asserted-by":"crossref","unstructured":"Gagneur J, Elze M, Tresch A (2011) Selective phenotyping, entropy reduction, and the mastermind game. BMC Bioinform 12(1):406 http:\/\/www.biomedcentral.com\/1471-2105\/12\/406","DOI":"10.1186\/1471-2105-12-406"},{"key":"99_CR3","first-page":"1","volume":"9","author":"E Knuth","year":"1977","unstructured":"Knuth E (1977) The computer as MasterMind. J Recreational Math 9:1\u20136","journal-title":"J Recreational Math"},{"issue":"2","key":"99_CR4","first-page":"81","volume":"11","author":"W Irving","year":"1979","unstructured":"Irving W (1979) Towards an optimum Mastermind strategy. J Recreational Math 11(2):81\u201387","journal-title":"J Recreational Math"},{"issue":"4","key":"99_CR5","first-page":"251","volume":"25","author":"K Koyama","year":"1993","unstructured":"Koyama K, Lai T (1993) An optimal Mastermind strategy. J Recrational Math 25(4):251\u2013256","journal-title":"J Recrational Math"},{"key":"99_CR6","volume-title":"Master Mind: a game of diagnosis strategies","author":"A Bestavros","year":"1986","unstructured":"Bestavros A, Belal A (1986) Master Mind: a game of diagnosis strategies. Bulletin of the faculty of engineering, Alexandria University, Alexandria, Egypt"},{"issue":"1","key":"99_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/ICG-2005-28105","volume":"28","author":"B Kooi","year":"2005","unstructured":"Kooi B (2005) Yet another mastermind strategy. ICGA J 28(1):13\u201320","journal-title":"ICGA J"},{"issue":"4","key":"99_CR8","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1093\/comjnl\/bxm006","volume":"50","author":"ST Chen","year":"2007","unstructured":"Chen ST, Lin SS, Huang LT (2007) A two-phase optimization algorithm for Mastermind. Comput J 50(4):435\u2013443","journal-title":"Comput J"},{"key":"99_CR9","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/j.ejor.2006.08.058","volume":"183","author":"ST Chen","year":"2007","unstructured":"Chen ST, Lin S, Huang L, Hsu S (2007) Strategy optimization for deductive games. Eur J Oper Res 183:757\u2013766","journal-title":"Eur J Oper Res"},{"key":"99_CR10","unstructured":"Merelo JJ, Mora AM, Cotta C, Runarsson TP (2012) An experimental study of exhaustive solutions for the Mastermind puzzle. ARXiV"},{"key":"99_CR11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1056635.1056637","volume":"85","author":"E Shapiro","year":"1983","unstructured":"Shapiro E (1983) Playing Mastermind logically. SIGART Bullet 85:28\u201329","journal-title":"SIGART Bullet"},{"key":"99_CR12","first-page":"130","volume":"30","author":"P Swaszek","year":"2000","unstructured":"Swaszek P (2000) The mastermind novice. J Recreational Math 30:130\u2013138","journal-title":"J Recreational Math"},{"key":"99_CR13","unstructured":"Temporal A, Kovacs T (2003) A heuristic hill climbing algorithm for Mastermind. In: Proceedings of the UK workshop on Computational Intelligence. Bristol, UK, pp 183-196"},{"key":"99_CR14","doi-asserted-by":"crossref","unstructured":"Bernier J, Herr\u00e1iz C, Merelo-Guerv\u00f3s JJ, Olmeda S, Prieto A (1996) Solving Mastermind using GAs and simulated annealing: a case of dynamic constraint optimization. In: Proceedings of the 4th international conference on parallel problem solving from nature. London, UK, pp 554\u2013563","DOI":"10.1007\/3-540-61723-X_1019"},{"key":"99_CR15","doi-asserted-by":"crossref","unstructured":"Bento L, Pereira L, Rosa A (1999) Mastermind by evolutionary algorithms. In: Proceedings of the sixth annual workshop on selected areas in cryptography. Kingston, Ontario, Canada, pp 307\u2013311","DOI":"10.1145\/298151.298360"},{"key":"99_CR16","unstructured":"Kalister T, Camens D (2003) Solving Mastermind using genetic algorithms. In: Proceedings of the genetic and evolutionary computation conference (GECCO). Chicago, USA, pp 1590\u20131591"},{"issue":"2","key":"99_CR17","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.asoc.2004.09.003","volume":"6","author":"JJ Merelo-Guerv\u00f3s","year":"2006","unstructured":"Merelo-Guerv\u00f3s JJ, Castillo P, Rivas V (2006) Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary MasterMind. Appl Soft Comput 6(2):170\u2013179","journal-title":"Appl Soft Comput"},{"key":"99_CR18","doi-asserted-by":"crossref","unstructured":"Maestro-Montojo J, Merelo JJ, Salcedo-Sanz S (2013) Comparing evolutionary algorithms to solve the game of MasterMind. Applications of Evolutionary Computation, Lecture Notes in Computer Science 7835:304\u2013313","DOI":"10.1007\/978-3-642-37192-9_31"},{"issue":"6","key":"99_CR19","doi-asserted-by":"crossref","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 (2009) Efficient solutions for Mastermind using genetic algorithms. Comput Operat Res 36(6):1880\u20131885","journal-title":"Comput Operat Res"},{"key":"99_CR20","doi-asserted-by":"crossref","unstructured":"Runarsson TP, Merelo-Guervos JJ (2010) Adapting heuristic Mastermind strategies to evolutionary algorithms. Proceedings of the international workshop on nature inspired cooperative strategies for optimization, Granada, Spain","DOI":"10.1007\/978-3-642-12538-6_22"},{"key":"99_CR21","volume-title":"Genetic programming: on the programming of computers by means of natural selection","author":"JR Koza","year":"1992","unstructured":"Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge"},{"key":"99_CR22","doi-asserted-by":"crossref","unstructured":"Koza JR (1992) Genetic programming","DOI":"10.1177\/105971239200100203"},{"key":"99_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5731-9","volume-title":"Genetic programming and data structures","author":"WB Langdon","year":"1998","unstructured":"Langdon WB (1998) Genetic programming and data structures. Kluwer, Boston"},{"key":"99_CR24","unstructured":"Koza JR, Poli R (2003) A genetic programming tutorial. In: Introductory tutorials in optimization, search and decision support, Chapter 8, E. Burke Editor"},{"key":"99_CR25","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10710-010-9112-3","volume":"11","author":"JR Koza","year":"2010","unstructured":"Koza JR (2010) Human-competitive results produced by genetic programming. Genet Program Evolvable Mach 11:251\u2013284","journal-title":"Genet Program Evolvable Mach"},{"key":"99_CR26","unstructured":"Angeline PJ, Kinnear KE Jr., (eds.) Advances in Genetic Programming 2. MIT Press, Cambridge"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-013-0099-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12065-013-0099-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-013-0099-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T14:57:51Z","timestamp":1564930671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12065-013-0099-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,11]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["99"],"URL":"https:\/\/doi.org\/10.1007\/s12065-013-0099-6","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,11]]}}}