Optimal analyses for 3×n AB games in the worst case

Li Te Huang*, Shun Shii Lin

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

1 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
主出版物標題Advances in Computer Games - 12th International Conference, ACG 2009, Revised Papers
頁面170-181
頁數12
DOIs
出版狀態已發佈 - 2010 六月 25
事件12th International Conference on Advances in Computer Games, ACG 2009 - Pamplona, 西班牙
持續時間: 2009 五月 112009 五月 13

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6048 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

其他

其他12th International Conference on Advances in Computer Games, ACG 2009
國家/地區西班牙
城市Pamplona
期間2009/05/112009/05/13

ASJC Scopus subject areas

  • 理論電腦科學
  • 電腦科學(全部)

指紋

深入研究「Optimal analyses for 3×n AB games in the worst case」主題。共同形成了獨特的指紋。

引用此