Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
The History Heuristic and Alpha-Beta Search Enhancements in Practice
IEEE Transactions on Pattern Analysis and Machine Intelligence
A generalised quiescence search algorithm
Artificial Intelligence - Special issue on computer chess
Kasparov Vs. Deep Blue: Computer Chess Comes of Age
Kasparov Vs. Deep Blue: Computer Chess Comes of Age
| Hi-index | 0.00 |
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.