Implementation of distributed chess engine using PaaS

G. Badhrinathan, A. Agarwal, R. Anand Kumar
{"title":"Implementation of distributed chess engine using PaaS","authors":"G. Badhrinathan, A. Agarwal, R. Anand Kumar","doi":"10.1109/ICCCTAM.2012.6488068","DOIUrl":null,"url":null,"abstract":"The present day limitation on clock speed of the CPU makes it burdensome to efficiently execute algorithms that require high processing power. This paper brings to picture how distributed systems can be utilized to address such issues, which are limited by the hardware configurations of current-day physical systems. To illustrate the same, the Minimax algorithm is depicted here. The algorithm that we have implemented dynamically chooses the depth based on the current branching-factor.","PeriodicalId":111485,"journal":{"name":"2012 International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM)","volume":"220 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCTAM.2012.6488068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The present day limitation on clock speed of the CPU makes it burdensome to efficiently execute algorithms that require high processing power. This paper brings to picture how distributed systems can be utilized to address such issues, which are limited by the hardware configurations of current-day physical systems. To illustrate the same, the Minimax algorithm is depicted here. The algorithm that we have implemented dynamically chooses the depth based on the current branching-factor.
使用PaaS实现分布式象棋引擎
目前对CPU时钟速度的限制使得高效执行需要高处理能力的算法变得繁重。本文描绘了如何利用分布式系统来解决这些问题,这些问题受到当前物理系统硬件配置的限制。为了说明这一点,这里描述了极大极小算法。我们实现的算法基于当前分支因子动态选择深度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信