| dc.contributor.advisor | 余清祥 | zh_TW |
| dc.contributor.author (Authors) | 張智凱 | zh_TW |
| dc.creator (作者) | 張智凱 | zh_TW |
| dc.date (日期) | 1998 | en_US |
| dc.date.accessioned | 10-May-2016 16:00:41 (UTC+8) | - |
| dc.date.available | 10-May-2016 16:00:41 (UTC+8) | - |
| dc.date.issued (上傳時間) | 10-May-2016 16:00:41 (UTC+8) | - |
| dc.identifier (Other Identifiers) | A2010000641 | en_US |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/95945 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 統計學系 | zh_TW |
| dc.description (描述) | 85354001 | zh_TW |
| dc.description.abstract (摘要) | In this paper, we consider a number-guessing game in which the competitor guesses numbers from several hints. If the competitor guesses at least one numbers correctly, he/she can keep on guessing the remaining incorrect numbers. We first explore the case when the hints are uniformly distributed. When the competitor has more information about the right numbers, there are different strategies to guess numbers. We study the optimal strategy in such case. In uniform case, we use recursive method to compute the winning probability. In non-uniform case, we find that the optimal strategy is to choose the most probable hints of each number. | en_US |
| dc.description.tableofcontents | 謝辭 Abstract Content Chapter 1. Introduction-----1 Chapter 2. Uniform game-----3 2-1. Winning probability-----3 2-2. The difference of winning probability of Games-----10 Chapter 3. Non-uniform game-----14 3-1. Optimal strategy-----14 3-2. The difference of winning probability of games with partial order property-----21 Chapter 4. Conclusion and suggestion-----26 References-----27 | zh_TW |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#A2010000641 | en_US |
| dc.title (題名) | A Study of Strategy for Guessing Game | en_US |
| dc.type (資料類型) | thesis | en_US |
