This paper presents a parallel move generation of a Chess machine system for achieving the purpose of reducing the number of move generation cycles. The parallel system is composed of five move generation modules which share the move generating cycles to reduce the time of building a game tree. Simulation results show that the proposed parallel move generation architecture takes about half of the number of move generation cycles to build a game tree that is the same as the one built by a sequential move generation module.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yi-Fan KE, Tai-Ming PARNG, "Parallel Move Generation System for Computer Chess" in IEICE TRANSACTIONS on Information,
vol. E79-D, no. 4, pp. 290-296, April 1996, doi: .
Abstract: This paper presents a parallel move generation of a Chess machine system for achieving the purpose of reducing the number of move generation cycles. The parallel system is composed of five move generation modules which share the move generating cycles to reduce the time of building a game tree. Simulation results show that the proposed parallel move generation architecture takes about half of the number of move generation cycles to build a game tree that is the same as the one built by a sequential move generation module.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_4_290/_p
Copy
@ARTICLE{e79-d_4_290,
author={Yi-Fan KE, Tai-Ming PARNG, },
journal={IEICE TRANSACTIONS on Information},
title={Parallel Move Generation System for Computer Chess},
year={1996},
volume={E79-D},
number={4},
pages={290-296},
abstract={This paper presents a parallel move generation of a Chess machine system for achieving the purpose of reducing the number of move generation cycles. The parallel system is composed of five move generation modules which share the move generating cycles to reduce the time of building a game tree. Simulation results show that the proposed parallel move generation architecture takes about half of the number of move generation cycles to build a game tree that is the same as the one built by a sequential move generation module.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Parallel Move Generation System for Computer Chess
T2 - IEICE TRANSACTIONS on Information
SP - 290
EP - 296
AU - Yi-Fan KE
AU - Tai-Ming PARNG
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 1996
AB - This paper presents a parallel move generation of a Chess machine system for achieving the purpose of reducing the number of move generation cycles. The parallel system is composed of five move generation modules which share the move generating cycles to reduce the time of building a game tree. Simulation results show that the proposed parallel move generation architecture takes about half of the number of move generation cycles to build a game tree that is the same as the one built by a sequential move generation module.
ER -