{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:00:02Z","timestamp":1725555602538},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642129926"},{"type":"electronic","value":"9783642129933"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12993-3_16","type":"book-chapter","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T08:43:37Z","timestamp":1272962617000},"page":"170-181","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Analyses for 3\u00d7n AB Games in the Worst Case"],"prefix":"10.1007","author":[{"given":"Li-Te","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shun-Shii","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.asoc.2004.09.003","volume":"6","author":"J.J. Merelo-Guervos","year":"2006","unstructured":"Merelo-Guervos, J.J., Castillo, P., Rivas, V.M.: 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"},{"key":"16_CR2","first-page":"1","volume":"9","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: The computer as Mastermind. Journal of Recreational Mathematics\u00a09, 1\u20136 (1976)","journal-title":"Journal of Recreational Mathematics"},{"issue":"2","key":"16_CR3","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)","journal-title":"Journal of Recreational Mathematics"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01917147","volume":"26","author":"E. Neuwirth","year":"1982","unstructured":"Neuwirth, E.: Some strategies for Mastermind. Mathematical Methods of Operations Research\u00a026, 257\u2013278 (1982)","journal-title":"Mathematical Methods of Operations Research"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1056531.1056533","volume":"90","author":"P. Norvig","year":"1984","unstructured":"Norvig, P.: Playing Mastermind optimally. ACM SIGART Bulletin\u00a090, 33\u201334 (1984)","journal-title":"ACM SIGART Bulletin"},{"key":"16_CR6","first-page":"251","volume":"25","author":"K. Koyama","year":"1993","unstructured":"Koyama, K., Lai, T.W.: An optimal Mastermind strategy. Journal of Recreational Mathematics\u00a025, 251\u2013256 (1993)","journal-title":"Journal of Recreational Mathematics"},{"key":"16_CR7","unstructured":"Rosu, R.: Mastermind. Master\u2019s thesis, North Carolina State University, Raleigh, North Carolina (1999)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/ICG-2005-28105","volume":"28","author":"K. Barteld","year":"2005","unstructured":"Barteld, K.: Yet another Mastermind strategy. ICGA Journal\u00a028(1), 13\u201320 (2005)","journal-title":"ICGA Journal"},{"issue":"3","key":"16_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/ICG-2007-30303","volume":"30","author":"L.T. Huang","year":"2007","unstructured":"Huang, L.T., Chen, S.T., Huang, S.J., Lin, S.S.: An efficient approach to solve Mastermind optimally. ICGA Journal\u00a030(3), 143\u2013149 (2007)","journal-title":"ICGA Journal"},{"key":"16_CR10","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. ACM SIGART Bulletin\u00a085, 28\u201329 (1983)","journal-title":"ACM SIGART Bulletin"},{"issue":"2","key":"16_CR11","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.S., Huang, L.T., Hsu, S.H.: Strategy optimization for deductive games. European Journal of Operational Research\u00a0183(2), 757\u2013766 (2007)","journal-title":"European Journal of Operational Research"},{"key":"16_CR12","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. Kalisker","year":"2003","unstructured":"Kalisker, 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)"},{"key":"16_CR13","unstructured":"Singley, A.: Heuristic solution methods for the 1-dimensional and 2-dimensional Mastermind problem. Master\u2019s thesis, University of Florida (2005)"},{"issue":"4","key":"16_CR14","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"},{"issue":"6","key":"16_CR15","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)","journal-title":"Computers and Operations Research"},{"issue":"1","key":"16_CR16","first-page":"105","volume":"20","author":"S.T. Chen","year":"2004","unstructured":"Chen, S.T., Lin, S.S.: Optimal algorithms for 2 \u00d7n AB games - a graph-partition approach. Journal of Information Science and Engineering\u00a020(1), 105\u2013126 (2004)","journal-title":"Journal of Information Science and Engineering"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1093\/comjnl\/47.5.602","volume":"47","author":"S.T. Chen","year":"2004","unstructured":"Chen, S.T., Lin, S.S.: Optimal algorithms for 2 \u00d7n Mastermind games - a graph-partition approach. The Computer Journal\u00a047(5), 602\u2013611 (2004)","journal-title":"The Computer Journal"},{"key":"16_CR18","first-page":"215","volume":"51","author":"W. Goddard","year":"2004","unstructured":"Goddard, W.: Mastermind revisited. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a051, 215\u2013220 (2004)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12993-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T21:18:13Z","timestamp":1552511893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12993-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129926","9783642129933"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12993-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}