Optimal algorithms for 2 × n mastermind games - A graph-partition approach

Computer Journal

Volumn 47, Issue 5, 2004, Pages 602-611

  Chen, Shan Tai ^a   Lin, Shun Shii ^a  

^a NATIONAL TAIWAN NORMAL UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION;

DEDUCTIVE GAMES; GRAPH PARTITION; MASTERMIND GAMES; OPTIMAL ALGORITHMS;

GAME THEORY;

EID: 4444355453     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/47.5.602     Document Type: Article

References (14)

1. Knuth, D. E. (1976) The computer as Mastermind. J. Recr. Math., 9(1), 1-6.
2. Irving, R. W. (1979) Towards an optimum Mastermind strategy. J. Recr. Math., 11(2), 81-87.
3. Neuwirth, E. (1982) Some strategies for Mastermind. Z. Oper. Res., 26, 257-278.
4. Koyama, K. T. and Lai, W. (1993) An optimal Mastermind strategy. J. Recr. Math., 25, 251-256.
5. Flood, M. M. (1988) Sequential search strategies with Mastermind variants - Part 1. J. Recr. Math., 20(2), 105-126.
6. Ko, K.-I. and Teng, S.-C. (1986) On the number of queries necessary to identify a permutation. J. Algor., 7, 449-462.
7. Chen, Z., Cunha, C. and Homer, S. (1996) Finding a hidden code by asking questions. In Second Ann. Int. Conf. on Computing and Combinatorics (COCOON '96), Hong Kong, June 17-19, pp. 50-55. Springer, Hong Kong.
8. Bento, L., Pereira, L. and Rosa, A. (1999) Mastermind by evolutionary algorithms. In Proc. ACM Symp. on Applied Computing SAC '99, San Antonio, TX, USA, 28 February-2 March, pp. 307-311. ACM Press.
9. Bernier, J. L., Herraiz, C. I., Merelo, J. J., Olmeda, S. and Prieto, A. (1996) Solving Mastermind using gas and simulated annealing: a case of dynamic constraint optimization. In Proc. PPSN, Parallel Problem Solving from Nature IV, in Computer Science, Berlin, Germany, September 22-27, pp. 554-563. Springer, Berlin.
10. Merelo, J. J., Carpio, J., Castillo, P., Rivas, V. M., Romero, G. and GeNeura Team (1999) Finding a needle in a haystack using hints and evolutionary computation: the case of Genetic Mastermind. In Genetic and Evolutionary Computation Conf. late breaking papers, Orlando, FO, USA, July 13-17, pp. 184-192. Morgan Kaufmann, San Francisco.
11. Roche, J. R. (1997) The value of adaptive questions in generalized Mastermind. In Proc. Int. Symp. on Information Theory IEEE, Ulm, Germany, 29 June-4 July, pp. 135-135. IEEE.
12. Kabatianski, G., Lebedev, V. and Thorpe, J. (2000) The Mastermind game and the rigidity of the Hamming space. In Proc. Int. Symp. on Information Theory IEEE, Sorrento, Italy, June 25-30, pp. 375. IEEE.
13. Chen, S. T. and Lin, S. S. (2004) Optimal algorithms for 2 × n AB games - a graph-partition approach. J. Inform. Sci. Eng., 20(1), 105-126.
14. Sedgewick, R. (1988) Algorithms (2nd edn). Addison-Wesley, Massachusetts.