Last update August 1, 2006

Technical Report #211

 


Alternative Use of Two Transposition Tables for Game-Tree Search

 

J. Nagashima, T. Hashimoto and H. Iida

Abstract. This paper concerns the use of transposition tables in game-tree search. The use of transposition tables enables a computer to efficiently search a game tree. Such a transposition table is used only during the current search in the conventional game-tree search. This paper proposes a method that uses alternatively two different transposition tables. One is for a game-tree search in the present position, while another one is for the search in the position where the player is to move next. This idea was implemented on computer shogi TACOS to evaluate. The results of the experiments performed show that the proposed method improves the search efficiency as well as the playing strength.

This paper was presented at Game Informatics Workshop GI-15, March 7, 2006, Tokyo, included in the Proceedings, IPSJ SIG Technical Reports, Vol.2006, No.23, pages 49-56. ISSN: 0919-6072

 

 

 


All Rights Reserved, Copyright(C) Research Unit for Computers and Games
Comments are welcome. Mail to address rccg@jaist.ac.jp, thanks.