Author:
El Ouali Mourad,Sauerland Volkmar
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Chvátal, V.: Mastermind. Combinatorica 3, 325–329 (1983)
2. Doerr, B., Spöhel, R., Thomas, H., Winzen, C.: Playing Mastermind with Many Colors. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 695–704. SIAM Society for Industrial and Applied Mathematics (2013)
3. Erdös, P., Rényi, C.: On Two Problems in Information Theory. Publications of the Mathematical Institute of the Hungarian Academy of Science 8, 229–242 (1963)
4. Goodrich, M.T.: On the algorithmic complexity of the Mastermind game with black-peg results. Information Processing Letters 109, 675–678 (2009)
5. Jäger, G., Peczarski, M.: The number of pessimistic guesses in generalized black-peg Mastermind. Information Processing Letters 111, 933–940 (2011)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献