An FPGA-based processor for shogi mating problems

Y. Hori, M. Sonoyama, T. Maruyama
{"title":"An FPGA-based processor for shogi mating problems","authors":"Y. Hori, M. Sonoyama, T. Maruyama","doi":"10.1109/FPT.2002.1188672","DOIUrl":null,"url":null,"abstract":"After the success of DEEP BLUE in computer chess, shogi, or Japanese chess is a next challenging target in artificial intelligence for game playing. The complexity and huge search space of shogi have been motivating researchers to make shogi programs, but none of them is competent enough to play against human experts. To improve the competence of shogi programs, it is a promising approach to develop dedicated hardware systems. However inflexible architecture and lack of hardware resource have been the significant problems in hardware development. The flexibility and recent progress in the gate size of FPGAs are expected to give solutions to the problems. As a first step to shogi hardware, we implemented modules to generate check and defense moves in tsume-shogi, or mating problems in shogi. With the latest FPGA, we successfully implemented all modules on a single chip and eliminated the bottleneck of memory bandwidth. In this paper we describe a procedure for parallel move generation in tsume-shogi hardware and architecture of the modules implemented on an FPGA. A discussion about the performance of the hardware is also included in the paper. The hardware is roughly estimated to work 10-50 times faster than software.","PeriodicalId":355740,"journal":{"name":"2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FPT.2002.1188672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

After the success of DEEP BLUE in computer chess, shogi, or Japanese chess is a next challenging target in artificial intelligence for game playing. The complexity and huge search space of shogi have been motivating researchers to make shogi programs, but none of them is competent enough to play against human experts. To improve the competence of shogi programs, it is a promising approach to develop dedicated hardware systems. However inflexible architecture and lack of hardware resource have been the significant problems in hardware development. The flexibility and recent progress in the gate size of FPGAs are expected to give solutions to the problems. As a first step to shogi hardware, we implemented modules to generate check and defense moves in tsume-shogi, or mating problems in shogi. With the latest FPGA, we successfully implemented all modules on a single chip and eliminated the bottleneck of memory bandwidth. In this paper we describe a procedure for parallel move generation in tsume-shogi hardware and architecture of the modules implemented on an FPGA. A discussion about the performance of the hardware is also included in the paper. The hardware is roughly estimated to work 10-50 times faster than software.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于fpga的shogi配对问题处理器
继“深蓝”在计算机国际象棋中取得成功之后,“将棋”将成为人工智能领域下一个具有挑战性的目标。将棋的复杂性和巨大的搜索空间一直激励着研究人员制作将棋程序,但它们都没有能力与人类专家对抗。为了提高将棋程序的能力,开发专用硬件系统是一种很有前途的方法。然而,硬件架构的不灵活和硬件资源的缺乏一直是硬件开发中的突出问题。fpga的灵活性和栅极尺寸的最新进展有望解决这些问题。作为shogi硬件的第一步,我们实现了模块来生成棋棋中的检查和防御动作,或者说是棋棋中的配对问题。利用最新的FPGA,我们成功地在单芯片上实现了所有模块,并消除了内存带宽的瓶颈。本文描述了在tsume-shogi硬件中并行移动生成的过程,以及在FPGA上实现的模块结构。本文还对硬件的性能进行了讨论。据粗略估计,硬件的工作速度比软件快10-50倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolution-based automated reconfiguration of field programmable analog devices Clustered programmable-reconfigurable processors Design and implementation of a novel architecture for symmetric FIR filters with boundary handling on Xilinx Virtex FPGAs Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing A co-simulation study of adaptive EPIC computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1