{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:14:07Z","timestamp":1755800047091},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662488980"},{"type":"electronic","value":"9783662488997"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48899-7_3","type":"book-chapter","created":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T22:59:28Z","timestamp":1448060368000},"page":"31-47","source":"Crossref","is-referenced-by-count":1,"title":["Cobra: A Tool for Solving General Deductive Games"],"prefix":"10.1007","author":[{"given":"Miroslav","family":"Klimo\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"3_CR1","unstructured":"COBRA, the COde-BReaking game Analyzer (2014). https:\/\/github.com\/myreg\/cobra"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bento, L., Pereira, L., Rosa, A.: Mastermind by evolutionary algorithms. In: Proceedings of the International Symposium on Applied Computing, pp. 307\u2013311. ACM (1999)","DOI":"10.1145\/298151.298360"},{"issue":"6","key":"3_CR3","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. Comput. Oper. Res. 36(6), 1880\u20131885 (2009)","journal-title":"Comput. Oper. Res."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","first-page":"554","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"J Bernier","year":"1996","unstructured":"Bernier, J., Herraiz, C., Merelo, J., Olmeda, S., Prieto, A.: Solving mastermind using GAs and simulated annealing: a case of dynamic constraint optimization. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN IV. LNCS, vol. 1141, pp. 554\u2013563. Springer, Heidelberg (1996)"},{"issue":"2\u20134","key":"3_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","volume":"4","author":"A Biere","year":"2008","unstructured":"Biere, A.: PicoSAT essentials. J. Satisfiability Boolean Model. Comput. 4(2\u20134), 75\u201397 (2008)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"3_CR6","unstructured":"Bond, M., Zieli\u0144ski, P.: Decimalisation table attacks for PIN cracking. Technical report UCAM-CL-TR-560 arXiv:1407.3926 , University of Cambridge (2003)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.ejor.2006.08.058","volume":"183","author":"ST Chen","year":"2007","unstructured":"Chen, S.T., Lin, S.S., Huang, L.T., Hsu, S.H.: Strategy optimization for deductive games. Eur. J. Oper. Res. 183, 757\u2013766 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.2307\/3611225","volume":"30","author":"F Dyson","year":"1946","unstructured":"Dyson, F.: The problem of the pennies. Math. Gaz. 30, 231\u2013234 (1946)","journal-title":"Math. Gaz."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"3_CR10","first-page":"229","volume":"8","author":"P Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On two problems of information theory. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl 8, 229\u2013243 (1963)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Gagneur, J., Elze, M., Tresch, A.: Selective phenotyping, entropy reduction, and the Mastermind game. BMC Bioinform. 12(406), 1\u201310 (2011)","DOI":"10.1186\/1471-2105-12-406"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Goodrich, M.: The Mastermind attack on genomic data. In: Proceedings of 30th IEEE Symposium on Security and Privacy, pp. 204\u2013218. IEEE (2009)","DOI":"10.1109\/SP.2009.4"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.2307\/2975353","volume":"102","author":"R Guy","year":"1995","unstructured":"Guy, R., Nowakowski, R.: Coin-weighting problems. Am. Math. Mon. 102(2), 164\u2013167 (1995)","journal-title":"Am. Math. Mon."},{"key":"3_CR14","unstructured":"Irving, R.: Towards an optimum mastermind strategy. J. Recreational Math. 11(2), 81\u201387 (1978\u20131979)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 135\u2013149. SIAM (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"3_CR16","unstructured":"Klimo\u0161, M., Ku\u010dera, A.: Strategy synthesis for general deductive games based on SAT solving. CoRR abs\/1407.3926 (2015)"},{"issue":"1","key":"3_CR17","first-page":"1","volume":"9","author":"D Knuth","year":"1976","unstructured":"Knuth, D.: The computer as mastermind. J. Recreational Math. 9(1), 1\u20136 (1976)","journal-title":"J. Recreational Math."},{"issue":"1","key":"3_CR18","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 J. 28(1), 13\u201320 (2005)","journal-title":"ICGA J."},{"issue":"4","key":"3_CR19","first-page":"251","volume":"25","author":"K Koyama","year":"1993","unstructured":"Koyama, K., Lai, T.: An optimal mastermind strategy. J. Recreational Math. 25(4), 251\u2013256 (1993)","journal-title":"J. Recreational Math."},{"key":"3_CR20","first-page":"257","volume":"26","author":"E Neuwirth","year":"1982","unstructured":"Neuwirth, E.: Some strategies for mastermind. Zeitschrift f\u00fcr Oper. Res. 26, 257\u2013278 (1982)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"1\u20132","key":"3_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2006.08.042","volume":"367","author":"G Steel","year":"2006","unstructured":"Steel, G.: Formal analysis of PIN block attacks. Theor. Comput. Sci. 367(1\u20132), 257\u2013270 (2006)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48899-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T13:22:08Z","timestamp":1599830528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48899-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662488980","9783662488997"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48899-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}