{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T23:51:09Z","timestamp":1709423469283},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,7,1]]},"DOI":"10.1093\/comjnl\/bxm006","type":"journal-article","created":{"date-parts":[[2007,3,7]],"date-time":"2007-03-07T03:01:17Z","timestamp":1173236477000},"page":"435-443","source":"Crossref","is-referenced-by-count":14,"title":["A Two-Phase Optimization Algorithm For Mastermind"],"prefix":"10.1093","volume":"50","author":[{"given":"Shan-Tai","family":"Chen","sequence":"first","affiliation":[]},{"given":"Shun-Shii","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Li-Te","family":"Huang","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2007,3,6]]},"reference":[{"key":"key\n\t\t\t\t20171011193756_BXM006C1","first-page":"1","article-title":"The computer as Mastermind","volume":"9","author":"Knuth","year":"1976","journal-title":"J. Recr. Math."},{"key":"key\n\t\t\t\t20171011193756_BXM006C2","first-page":"25","article-title":"Mastermind is NP-Complete","volume":"5","author":"Stuckman","year":"2006","journal-title":"INFOCOMP J. Comput. Sci."},{"key":"key\n\t\t\t\t20171011193756_BXM006C3","first-page":"184","article-title":"(1999) Finding a needle in a haystack using hints and evolutionary computation: the case of genetic Mastermind","author":"Merelo"},{"key":"key\n\t\t\t\t20171011193756_BXM006C4","first-page":"81","article-title":"Towards an optimum Mastermind strategy","volume":"11","author":"Irving","year":"1978","journal-title":"J. Recr. Math."},{"key":"key\n\t\t\t\t20171011193756_BXM006C5","first-page":"257","article-title":"Some strategies for Mastermind","volume":"26","author":"Neuwirth","year":"1982","journal-title":"Z. Oper. Res."},{"key":"key\n\t\t\t\t20171011193756_BXM006C6","first-page":"251","article-title":"An optimal Mastermind strategy","volume":"25","author":"Koyama","year":"1993","journal-title":"J. Recr. Math."},{"key":"key\n\t\t\t\t20171011193756_BXM006C7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/0196-6774(86)90013-1","article-title":"On the number of queries necessary to identify a permutation","volume":"7","author":"Ko","year":"1986","journal-title":"J. Algorithms"},{"key":"key\n\t\t\t\t20171011193756_BXM006C8","first-page":"105","article-title":"Sequential search strategies with Mastermind variants \u2013 Part 1","volume":"20","author":"Flood","year":"1988","journal-title":"J. Recr. Math."},{"key":"key\n\t\t\t\t20171011193756_BXM006C9","first-page":"307","article-title":"Mastermind by evolutionary algorithms","author":"Bento","year":"1999"},{"key":"key\n\t\t\t\t20171011193756_BXM006C10","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1007\/3-540-45110-2_39","article-title":"Solving Mastermind using genetic algorithms","volume":"2724","author":"Kalisker","year":"2003","journal-title":"Lect. Notes Comput. Sci."},{"key":"key\n\t\t\t\t20171011193756_BXM006C11","first-page":"135","article-title":"The value of adaptive questions in generalized Mastermind","author":"Roche","year":"1997"},{"key":"key\n\t\t\t\t20171011193756_BXM006C12","first-page":"375","article-title":"The Mastermind game and the rigidity of the Hamming space","author":"Kabatianski","year":"2000"},{"key":"key\n\t\t\t\t20171011193756_BXM006C13","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1093\/comjnl\/47.5.602","article-title":"Optimal algorithms for 2 \u00d7 n Mastermind games\u2013a graph-partition approach","volume":"47","author":"Chen","year":"2004","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20171011193756_BXM006C14","first-page":"13","article-title":"Yet another Mastermind strategy","volume":"28","author":"Barteld","year":"2005","journal-title":"Int. Comput. Games Assoc. J."},{"key":"key\n\t\t\t\t20171011193756_BXM006C15","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: overview and conceptual comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv."},{"key":"key\n\t\t\t\t20171011193756_BXM006C16","volume-title":"Adaptation in Natural and Arstificial Systems","author":"Holland","year":"1975"},{"key":"key\n\t\t\t\t20171011193756_BXM006C17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"key\n\t\t\t\t20171011193756_BXM006C18","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t20171011193756_BXM006C19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"key\n\t\t\t\t20171011193756_BXM006C20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: a cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"key\n\t\t\t\t20171011193756_BXM006C21","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","article-title":"A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem","volume":"177","author":"Ruiz","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20171011193756_BXM006C22","first-page":"607","article-title":"Limited discrepancy search","author":"Harvey","year":"1995"},{"key":"key\n\t\t\t\t20171011193756_BXM006C23","first-page":"271","article-title":"Heuristic-biased stochastic sampling","author":"Bresina","year":"1996"},{"key":"key\n\t\t\t\t20171011193756_BXM006C24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.1996.tb00032.x","article-title":"Heuristics from nature for hard combinatorial optimization problems","volume":"3","author":"Colorni","year":"1996","journal-title":"Int. Trans. Oper. Res."},{"key":"key\n\t\t\t\t20171011193756_BXM006C25","first-page":"13","article-title":"Using selective-sampling simulations in poker","author":"Billings","year":"1999"},{"key":"key\n\t\t\t\t20171011193756_BXM006C26","first-page":"776","article-title":"A sampling-based heuristic for tree search applied to grammar induction","author":"Juil\u013ae","year":"1998"},{"key":"key\n\t\t\t\t20171011193756_BXM006C27","first-page":"235","article-title":"Incomplete tree search using adaptive probing","author":"Ruml","year":"2001"},{"key":"key\n\t\t\t\t20171011193756_BXM006C28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"J. Glob. Optim."},{"key":"key\n\t\t\t\t20171011193756_BXM006C29","article-title":"Greedy randomized adaptive search procedure","volume-title":"Handbook of Applied Optimization","author":"Pitsoulis","year":"2002"},{"key":"key\n\t\t\t\t20171011193756_BXM006C30","article-title":"Searching with analysis of dependencies in a solitaire card game","volume-title":"Advances in Computer Games 10","author":"Helmstetter","year":"2003"},{"key":"key\n\t\t\t\t20171011193756_BXM006C31","first-page":"29","article-title":"Efficient selectivity and backup operators in Monte\u2013Carlo tree search","author":"Coulom","year":"2006"},{"key":"key\n\t\t\t\t20171011193756_BXM006C32","first-page":"105","article-title":"Optimal algorithms for 2 \u00d7 n AB games \u2013 a graph-partition approach","volume":"20","author":"Chen","year":"2004","journal-title":"J. Inf. Sci. Eng."},{"key":"key\n\t\t\t\t20171011193756_BXM006C33","volume-title":"Algorithms","author":"Sedgewick","year":"1988","edition":"2nd edn."},{"key":"key\n\t\t\t\t20171011193756_BXM006C34","unstructured":"Chen\n              S.T.\n            \n          \n          On the study of optimization algorithms for deductive games and related problems\n          2004\n          Taipei, R.O.C\n          National Taiwan Normal University"},{"key":"key\n\t\t\t\t20171011193756_BXM006C35","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell","year":"2003","edition":"2nd edn"},{"key":"key\n\t\t\t\t20171011193756_BXM006C36","unstructured":"Lin\n              S.S.\n            \n          \n          Mastermind Games & AB Games\n          2005\n          Available at: http:\/\/www.csie.ntnu.edu.tw\/~linss\/deductivegame\/index.htm."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/50\/4\/435\/1180125\/bxm006.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,11]],"date-time":"2017-10-11T23:38:34Z","timestamp":1507765114000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/50\/4\/435\/427045\/A-TwoPhase-Optimization-Algorithm-For-Mastermind"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,6]]},"references-count":36,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2007,3,6]]},"published-print":{"date-parts":[[2007,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxm006","relation":{},"ISSN":["1460-2067","0010-4620"],"issn-type":[{"value":"1460-2067","type":"electronic"},{"value":"0010-4620","type":"print"}],"subject":[],"published-other":{"date-parts":[[2007,7]]},"published":{"date-parts":[[2007,3,6]]}}}