Optimal Analyses for 3×n AB Games in the Worst Case
The past decades have witnessed a growing interest in research on deductive games such as Mastermind and AB game. Because of the complicated behavior of deductive games, tree-search approaches are often adopted to find their optimal strategies. In this paper, a generalized version of deductive games, called 3×n AB games, is introduced. However, traditional tree-search approaches are not appropriate for solving this problem since it can only solve instances with smaller n. For larger values of n, a systematic approach is necessary. Therefore, intensive analyses of playing 3×n AB games in the worst case optimally are conducted and a sophisticated method, called structural reduction, which aims at explaining the worst situation in this game is developed in the study. Furthermore, a worthwhile formula for calculating the optimal numbers of guesses required for arbitrary values of n is derived and proven to be final.
KeywordsMastermind Strategy Optimal Analysis Hard State Apply Soft Computing Adversary Response
Unable to display preview. Download preview PDF.
- 3.Irving, R.W.: Towards an optimum Mastermind strategy. Journal of Recreational Mathematics 11(2), 81–87 (1978)Google Scholar
- 7.Rosu, R.: Mastermind. Master’s thesis, North Carolina State University, Raleigh, North Carolina (1999)Google Scholar
- 8.Barteld, K.: Yet another Mastermind strategy. ICGA Journal 28(1), 13–20 (2005)Google Scholar
- 9.Huang, L.T., Chen, S.T., Huang, S.J., Lin, S.S.: An efficient approach to solve Mastermind optimally. ICGA Journal 30(3), 143–149 (2007)Google Scholar
- 12.Kalisker, T., Camens, D.: Solving Mastermind using genetic algorithms. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1590–1591. Springer, Heidelberg (2003)CrossRefGoogle Scholar
- 13.Singley, A.: Heuristic solution methods for the 1-dimensional and 2-dimensional Mastermind problem. Master’s thesis, University of Florida (2005)Google Scholar