置换表在随机博弈树搜索中的有效应用

2007 IEEE Symposium on Computational Intelligence and Games Pub Date : 2007-04-01 DOI:10.1109/CIG.2007.368086

J. Veness, Alan Blair

{"title":"置换表在随机博弈树搜索中的有效应用","authors":"J. Veness, Alan Blair","doi":"10.1109/CIG.2007.368086","DOIUrl":null,"url":null,"abstract":"Transposition tables are one common method to improve an alpha-beta searcher. We present two methods for extending the usage of transposition tables to chance nodes during stochastic game tree search. Empirical results show that these techniques can reduce the search effort of Ballard's Star2 algorithm by 37 percent.","PeriodicalId":365269,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence and Games","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Effective Use of Transposition Tables in Stochastic Game Tree Search\",\"authors\":\"J. Veness, Alan Blair\",\"doi\":\"10.1109/CIG.2007.368086\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Transposition tables are one common method to improve an alpha-beta searcher. We present two methods for extending the usage of transposition tables to chance nodes during stochastic game tree search. Empirical results show that these techniques can reduce the search effort of Ballard's Star2 algorithm by 37 percent.\",\"PeriodicalId\":365269,\"journal\":{\"name\":\"2007 IEEE Symposium on Computational Intelligence and Games\",\"volume\":\"35 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.368086\",\"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.368086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

换位表是改进alpha-beta搜索器的一种常用方法。在随机博弈树搜索中，我们提出了两种将置换表的使用扩展到机会节点的方法。实证结果表明，这些技术可以将巴拉德的Star2算法的搜索工作量减少37%。

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

查看原文本刊更多论文

Effective Use of Transposition Tables in Stochastic Game Tree Search

Transposition tables are one common method to improve an alpha-beta searcher. We present two methods for extending the usage of transposition tables to chance nodes during stochastic game tree search. Empirical results show that these techniques can reduce the search effort of Ballard's Star2 algorithm by 37 percent.

求助全文

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

来源期刊

2007 IEEE Symposium on Computational Intelligence and Games

自引率

0.00%

发文量