实现全甲板

ACM Signum Newsletter Pub Date : 1995-10-01 DOI:10.1145/219340.219344

H. Hodge

{"title":"实现全甲板","authors":"H. Hodge","doi":"10.1145/219340.219344","DOIUrl":null,"url":null,"abstract":"While in the process of computing poker odds, the following question occurred to me: given a random number generator that returns answers from one to 52, how many calls on average need to be made before at least one of each number is found?","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"58 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Achieving a full deck\",\"authors\":\"H. Hodge\",\"doi\":\"10.1145/219340.219344\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"While in the process of computing poker odds, the following question occurred to me: given a random number generator that returns answers from one to 52, how many calls on average need to be made before at least one of each number is found?\",\"PeriodicalId\":177516,\"journal\":{\"name\":\"ACM Signum Newsletter\",\"volume\":\"58 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Signum Newsletter\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/219340.219344\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Signum Newsletter","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/219340.219344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在计算扑克赔率的过程中，我想到了以下问题:给定一个随机数生成器，返回从1到52的答案，平均需要调用多少次才能找到每个数字中的至少一个?

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Achieving a full deck

While in the process of computing poker odds, the following question occurred to me: given a random number generator that returns answers from one to 52, how many calls on average need to be made before at least one of each number is found?

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Signum Newsletter

自引率

0.00%

发文量