Abstract
LetV(n, k) denote the set of vectors of lengthn whose components are integersj with 1≦j≦k. For every two vectorsx, y inV(n, k), leta(x, y) stand for the number of subscriptsi withx i =y i . We prove that for every positive ε there is ann(ε) with the following property: ifn>n(ε) andk<n 1−ε then there is a setQ of at most (6+ε)(n logk)/(logn−logk) vectors inV(n, k) such that for every two distinct vectorsx, y inV(n, k) someq inQ hasa(q, x) ≠a(q, y).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Reference
D. E. Knuth, The computer as a Master Mind,Journal of Recreational Mathematics 9 (1976–77), 1–6.
Author information
Authors and Affiliations
Additional information
Dedicated to Paul Erdős on his seventieth birthday
Rights and permissions
About this article
Cite this article
Chvátal, V. Mastermind. Combinatorica 3, 325–329 (1983). https://doi.org/10.1007/BF02579188
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02579188