{"title":"纸牌Yahtzee的计算机策略","authors":"James R. Glenn","doi":"10.1109/CIG.2007.368089","DOIUrl":null,"url":null,"abstract":"Solitaire Yahtzee has been solved completely. However, the optimal strategy is not one a human could practically use, and for computer play it requires either a very large database or significant CPU time. We present some refinements to the techniques used to solve solitaire Yahtzee and give a method for analyzing other solitaire strategies and give some examples of this analysis for some non-optimal strategies, including some produced by evolutionary algorithms","PeriodicalId":365269,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence and Games","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Computer Strategies for Solitaire Yahtzee\",\"authors\":\"James R. Glenn\",\"doi\":\"10.1109/CIG.2007.368089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Solitaire Yahtzee has been solved completely. However, the optimal strategy is not one a human could practically use, and for computer play it requires either a very large database or significant CPU time. We present some refinements to the techniques used to solve solitaire Yahtzee and give a method for analyzing other solitaire strategies and give some examples of this analysis for some non-optimal strategies, including some produced by evolutionary algorithms\",\"PeriodicalId\":365269,\"journal\":{\"name\":\"2007 IEEE Symposium on Computational Intelligence and Games\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Symposium on Computational Intelligence and Games\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2007.368089\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence and Games","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2007.368089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solitaire Yahtzee has been solved completely. However, the optimal strategy is not one a human could practically use, and for computer play it requires either a very large database or significant CPU time. We present some refinements to the techniques used to solve solitaire Yahtzee and give a method for analyzing other solitaire strategies and give some examples of this analysis for some non-optimal strategies, including some produced by evolutionary algorithms