The APHID parallel /spl alpha//spl beta/ search algorithm

M. Brockington, J. Schaeffer
{"title":"The APHID parallel /spl alpha//spl beta/ search algorithm","authors":"M. Brockington, J. Schaeffer","doi":"10.1109/SPDP.1996.570365","DOIUrl":null,"url":null,"abstract":"The paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated game-tree and all of the leaves of that tree are searched in parallel. APHID has been programmed as an easy to implement, game-independent /spl alpha//spl beta/ library, and has been tested on several game-playing programs. Results for an Othello program are presented. The algorithm yields good parallel performance on a network of workstations, without using a shared transposition table.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"459 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1996.570365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated game-tree and all of the leaves of that tree are searched in parallel. APHID has been programmed as an easy to implement, game-independent /spl alpha//spl beta/ library, and has been tested on several game-playing programs. Results for an Othello program are presented. The algorithm yields good parallel performance on a network of workstations, without using a shared transposition table.
APHID并行/spl alpha//spl beta/搜索算法
介绍了异步并行层次迭代深化(APHID)博弈树搜索算法。APHID与实践中使用的方法不同。与基于最小搜索树的并行性不同,APHID使用截断的游戏树,并且并行搜索该树的所有叶子。APHID已被编程为一个易于实现的,独立于游戏的/spl alpha//spl beta/库,并已在几个游戏程序上进行了测试。给出了一个奥赛罗程序的结果。该算法在不使用共享换位表的情况下,在工作站网络上产生了良好的并行性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信