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

Journal of Information Science and Engineering

Volumn 20, Issue 1, 2004, Pages 105-126

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

^a NATIONAL TAIWAN NORMAL UNIVERSITY   (Taiwan)

Author keywords

AB game; Algorithms; Game tree; Mastermind; Search strategies

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; INTEGRATED CIRCUIT TESTING; MATHEMATICAL MODELS; ONLINE SYSTEMS; OPTIMIZATION; QUERY LANGUAGES; THEOREM PROVING; TREES (MATHEMATICS);

AB GAME; COMBINATORIAL OPTIMIZATION; GAME TREE; MASTERMIND; OPTIMAL ALGORITHMS; SEARCH STRATEGIES;

GAME THEORY;

EID: 0842290663     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. D. E. Knuth, "The computer as mastermind," Journal of Recreational Mathematics, Vol. 9, 1976, pp. 1-6.
2. R. W. Irving, "Towards an optimum mastermind strategy," Journal of Recreational Mathematics, Vol. 11, 1978-79, pp. 81-87.
3. E. Neuwirth, "Some strategies for mastermind," Zeitschrift fur Operations Research, Vol. 26, 1982, pp. 257-278.
4. K. Koyama and T. W. Lai, "An optimal mastermind strategy," Journal of Recreational Mathematics, Vol. 25, 1993, pp. 251-256.
5. M. M. Flood, "Sequential search strategies with mastermind variants - Part 1," Journal of Recreational Mathematics, Vol. 20, 1988, pp. 105-126.
6. K. I. Ko and S. C. Teng, "On the number of queries necessary to identify a permutation," Journal of Algorithms, Vol. 7, 1986, pp. 449-462.
7. Z. X. Chen and C. Cunha, "Finding a hidden code by asking questions," in Proceedings of the International Computing and Combinatorics Conference (COCOON '96), 1996, p. 50-55.
8. L. Bento, L. Pereira, and A. Rosa, "Mastermind by evolutionary algorithms," in Proceedings of the International Symposium on Applied Computing, 1996, pp. 307-311.
9. J. L. Bernier, C. I. Herraiz, J. J. Merelo, S. Olmeda, and A. Prieto, "Solving mastermind using gas and simulated annealing: a case of dynamic constraint optimization," in Proceedings of Parallel Problem Solving from Nature IV (PPSN IV), 1996, pp. 554-563.
10. J. J. Merelo, J. Carpio, P. Castillo, V. M. Rivas, and G. Romero (GeNeura Team), "Finding a needle in a haystack using hints and evolutionary computation: the case of genetic mastermind," in Proceedings of the Genetic and Evolutionary Computation Conference late breaking papers, 1999, pp. 184-192.
11. J. R. Roche, "The value of adaptive questions in generalized mastermind," in Proceedings of IEEE on the International Symposium on Information Theory, 1997, pp. 135-153.
12. G. Kabatianski and V. Lebedev, "The mastermind game and the rigidity of the hamming space," in Proceedings of IEEE on the International Symposium on Information Theory, 2000, pp. 375-375.
13. R. Sedgewick, Algorithms, 2nd edition, Addison-Wesley, 1988.
14. D. E. Knuth, "Sorting and searching," The Art of Computer Programming, Vol. 3, 2nd edition, Addison Wesley, 1998.
15. S. T. Chen, S. H. Hsu, and S. S. Lin, "An optimal strategy for 2 x n AB games," in Proceedings of the 2002 International Computer Symposium on Algorithms and Computational Molecular Biology, 2002, pp. C2-2.