Abstract
In this paper we describe the architecture of a shogi processor based on reconfigurable hardware. For our implementation, we have used Field Programmable Gate Arrays (FPGAs), which can be reconfigured dynamically by downloading configuration data from host computers. Because of this reconfiguration flexibility, it is possible to implement and evaluate new algorithms quickly and to make small subsystems (of very low cost) that can be used on demand. For shogi these two features are especially important, as there are no stable subsystems that can be ported to special purpose hardware. Also, in shogi different modules are needed for different stages of the game. To test the feasibility of using FPGAs for shogi, we have implemented two modules that are general for all strong shogi programs on one off-the-shelf PCI board with one FPGA. The piece cover module on an FPGA is 62 times faster than the software module, while the module for finding mate on an FPGA is 9 times faster than the software module.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Altera Corporation, San Jose, CA, USA, Embedded Programmable Logic Data Sheet, August 1999, ver 2.02.
D. Beal.AGeneralised Quiescence SearchAlgorithm. Artificial Intelligence, 43:85–98, 1990.
R. Grimbergen, “Candidate Relevance Analysis for Selective Search in Shogi”, in Advances in Computer Chess Conference, Paderborn, Germany, 1999.
R. Grimbergen, “A Plausible Move Generator for Shogi Using Static Evaluation”, in Game Programming Workshop, pp. 9–15, Kanagawa, Japan, 1999.
S. Hamilton and L. Garber, “Deep Blue’s Hardware-Software Synergy”, IEEE Computer, Oct., 1997, pp.29–35.
G. Kakinoki, “The Search Algorithm of the Shogi Program K3.0”, In H. Matsubara, editor, Computer Shogi Progress, pp.1–23. Tokyo: Kyoritsu Shuppan Co, 1996. ISBN 4-320-02799-X. (in Japanese).
H. Matsubara and K. Handa, “Some properties of shogi as a game”, Proceedings of Artificial Intelligence, 96(3):21–30, 1994. (in Japanese).
H. Matsubara, H. ida and R. Grimbergen, “Natural developments in game research”, ICCA Journal, 19(2):103–112, June 1996.
Monty Newborn, “Kasparov versus Deep Blue: computer chess comes of age”, Springer, 1997, ISBN 0-387-94820-1.
J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison Wesley Publishing Company: Reading, Massachusetts, 1984. ISBN 0-201-05594-5.
J. Schaeffer. The History Heuristic and Alpha-Beta Search Enhancements in Practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(11):1203–1212, 1989.
M. Seo, “A tsume shogi solver using conspiracy numbers”, in H. Matsubara, editor, Computer Shogi Progress 2, pp.1–21, Tokyo:Kyoritsu Shuppan Co, 1998, ISBN 4-320-02799-X. (in Japanese).
C.E. Shannon, “Programming a computer for playing chess,” Philosophical Magazine 41(1950): 256-75.
H. Yamashita, “YSS: About its Datastructures and Algorithm”, In H. Matsubara, editor, Computer Shogi Progress 2, pp.112–142. Tokyo: Kyoritsu Shupppan Co, 1998. ISBN 4-320-02799-X. (in Japanese).
Xilinx, Inc., San Jose, CA, USA, The Programmable Logic Data Book, 1999.
URL: http://www.fccm.org
URL: http://xputers.informatik.uni-kl.de/FPL/FPL99/index.html
URL: http://www.ece.cmu.edu/~fpga2000
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hori, Y., Seki, M., Maruyama, T., Grimbergen, R., Hoshino, T. (2001). A Shogi Processor with a Field Programmable Gate Array. In: Marsland, T., Frank, I. (eds) Computers and Games. CG 2000. Lecture Notes in Computer Science, vol 2063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45579-5_20
Download citation
DOI: https://doi.org/10.1007/3-540-45579-5_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43080-3
Online ISBN: 978-3-540-45579-0
eBook Packages: Springer Book Archive