{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T14:19:18Z","timestamp":1751465958029},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617235"},{"type":"electronic","value":"9783540706687"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61723-x_1019","type":"book-chapter","created":{"date-parts":[[2006,7,12]],"date-time":"2006-07-12T14:34:58Z","timestamp":1152714898000},"page":"553-563","source":"Crossref","is-referenced-by-count":14,"title":["Solving MasterMind using GAs and simulated annealing: A case of dynamic constraint optimization"],"prefix":"10.1007","author":[{"given":"J. L.","family":"Bernier","sequence":"first","affiliation":[]},{"given":"C. Ilia","family":"Herr\u00e1iz","sequence":"additional","affiliation":[]},{"given":"J. J.","family":"Merelo","sequence":"additional","affiliation":[]},{"given":"S.","family":"Olmeda","sequence":"additional","affiliation":[]},{"given":"A.","family":"Prieto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,11]]},"reference":[{"key":"56_CR1","unstructured":"Melle Koning. Mastermind. newsgroup comp.ai.games, archived at http:\/\/www.krl.caltech.edu\/\u223cbrown\/alife\/news\/ai-games-html\/0370.html."},{"key":"56_CR2","unstructured":"Tim Cooper. Mastermind. newsgroup comp.ai.games, archived at http:\/\/www.krl.caltech.edu\/\u223cbrown\/alife\/news\/ai-games-html\/0313.html."},{"key":"56_CR3","first-page":"1","volume":"9","author":"D. E. Knuth","year":"1976\u201377","unstructured":"Donald E. Knuth. The computer as Master Mind. J. Recreational Mathematics, (9):1\u20136, 1976\u201377.","journal-title":"J. Recreational Mathematics"},{"key":"56_CR4","unstructured":"Kenji Koyama; T. W. Lai. An optimal Mastermind strategy. J. Recreational Mathematics, 1994."},{"issue":"8","key":"56_CR5","doi-asserted-by":"publisher","first-page":"B257","DOI":"10.1007\/BF01917147","volume":"26","author":"E. Neuwirth","year":"1982","unstructured":"E. Neuwirth. Some strategies for mastermind. Zeitschrift fur Operations Research. Serie B, 26(8):B257\u2013B278, 1982.","journal-title":"Zeitschrift fur Operations Research. Serie B"},{"issue":"1","key":"56_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1051\/ro\/1987210100871","volume":"21","author":"D. Viaud","year":"1987","unstructured":"D. Viaud. Une strategie generale pour jouer au Mastermind. RAIRO-Recherche Operationelle, 21(1):87\u2013100, 1987.","journal-title":"RAIRO-Recherche Operationelle"},{"issue":"3","key":"56_CR7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1051\/ro\/1979130303071","volume":"13","author":"D. Viaud","year":"1979","unstructured":"D. Viaud. Une formalisation du jeu de Mastermind. RAIRO-Recherche Operationelle, 13(3):307\u2013321, 1979.","journal-title":"RAIRO-Recherche Operationelle"},{"key":"56_CR8","unstructured":"Leon Sterling; Ehud Shapiro. The Art of Prolog: Advanced Programming Techniques. MIT press, 1986."},{"issue":"3\u20134","key":"56_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02579188","volume":"3","author":"V. Chvatal","year":"1983","unstructured":"V. Chvatal. Mastermind. Combinatorica, 3(3\u20134):325\u2013329, 1983.","journal-title":"Combinatorica"},{"key":"56_CR10","unstructured":"Risto Widenius. Mastermind. newsgroup comp.ai.games, archived at http:\/\/www.krl.caltech.edu\/\u223cbrown\/alife\/news\/ai-games-html\/1311.html."},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"Zbigniew Michalewicz. Genetic Algorithms+Data Structures=Evolution programs. Springer-Verlag, 2nd edition edition, 1994.","DOI":"10.1007\/978-3-662-07418-3"},{"key":"56_CR12","unstructured":"Marc Schoenauer; Spyros Xanthakis. Constrained GA optimization. In Forrest [25], pages 573\u2013580."},{"key":"56_CR13","unstructured":"John J. Grefenstette. Genetic algorithms for changing environments. In R. Maenner; B. Manderick, editor, Parallel Problem Solving from Nature, 2, pages 137\u2013144. Elsevier Science Publishers B. V., 1992."},{"key":"56_CR14","doi-asserted-by":"crossref","unstructured":"Helen G. Cobb; John J. Grefenstette. Genetic algorithms for tracking changing environments. In Forrest [25], pages 523\u2013530.","DOI":"10.21236\/ADA294075"},{"key":"56_CR15","unstructured":"A. Barak J. Maresky; Y. Davidor; D. Gitler; G. Aharoni. Selective destructive re-start. In Eshelman [26], pages 144\u2013150."},{"key":"56_CR16","unstructured":"David E. Goldberg. Zen and the art of genetic algorithms. In J. David Schaffer, editor, Procs. of the 3rd Int. Conf. on Genetic Algorithms, ICGA89, pages 80\u201385. Morgan Kauffmann, 1989."},{"key":"56_CR17","unstructured":"Conor Ryan. Advances in Genetic Programming, chapter Pygmies and Civil Servants. MIT press, 1992."},{"key":"56_CR18","unstructured":"J. J. Merelo. Genetic Mastermind, a case of dynamic constraint optimization. GeNeura Technical Report G-96-1, Universidad de Granada, 1996."},{"key":"56_CR19","unstructured":"Bryant A. Julstrom. What have you done for me lately? Adapting operator probabilities in a steady-state Genetic Algorithm. In Eshelman [26], pages 81\u201387."},{"key":"56_CR20","unstructured":"John J. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975."},{"key":"56_CR21","unstructured":"D. B. Fogel. Evolutionary Computation: Towards a New Philosophy of Machine Intelligence. IEEE press, 1995."},{"key":"56_CR22","doi-asserted-by":"crossref","unstructured":"J. Aarts, E.; Korst. Simulated Annealing and Boltzmann Machines. John Wiley & Sons, 1989.","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"56_CR23","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"C. H. Papadimitriou; K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, New York, 1982."},{"key":"56_CR24","unstructured":"S. W. Mahfoud; D. E. Goldberg. Parallel recombinative simulated annealing: A genetic algorithm. Technical report, IlliGAL Report no. 92002, Dept. Of General Engineering, UIUC., 1992."},{"key":"56_CR25","unstructured":"Stephanie Forrest, editor. Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann, 1993."},{"key":"56_CR26","unstructured":"Larry J. Eshelman, editor. Proceedings of the 6th International Conference on Genetic Algorithms. Morgan Kaufmann, 1995."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61723-X_1019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T01:31:24Z","timestamp":1683509484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61723-X_1019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617235","9783540706687"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-61723-x_1019","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}