Optimal Analyses for 3×n AB Games in the Worst Case

@inproceedings{Huang2009OptimalAF,
  title={Optimal Analyses for 3×n AB Games in the Worst Case},
  author={Li-Te Huang and Shun-Shii Lin},
  booktitle={ACG},
  year={2009}
}
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, tranditional tree-search approaches are not appropriate for solving this problem since it can only solve instances with smaller n. For larger values… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Towards an optimum Mastermind strategy

  • R. W. Irving
  • Journal of Recreational Mathematics
  • 1978
Highly Influential
1 Excerpt

Heuristic solution methods for the 1-dimensional and 2-dimensional Mastermind problem

  • A. Singley
  • Master’s thesis. University of Florida
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…