2024-03-29T00:55:29Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:000974972023-11-14T00:51:14Z06164:06165:06210:07361
Search efficiency in Computer ShogiSearch efficiency in Computer Shogienghttp://id.nii.ac.jp/1001/00097475/Conference Paperhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=97497&item_no=1&attribute_id=1&file_no=1Copyright (c) 2001 by the Information Processing Society of JapanDepartment of Computer Science, Shizuoka UniversityDepartment of Computer Science, Shizuoka UniversityDepartment of Computer Science, Shizuoka UniversityDepartment of Computer Science, Shizuoka UniversityTaketoshi, MasafumiHashimoto, TsuyoshiSakuta, MakotoIida, HiroyukiThe enhancement of the search efficiency in a computer Shogi program is studied. Several well-known methods for selecting the promising moves, which have been used by the strongest programs, are investigated by examining the results obtained by applying these methods for the move ordering in the endgame problems and some kinds of grandmasters' games. The cut-off by selecting the escape moves is relatively significant in the static positions such as opening, while the cut-off by selecting the capturing moves is greatly significant in the tactical positions.The enhancement of the search efficiency in a computer Shogi program is studied. Several well-known methods for selecting the promising moves, which have been used by the strongest programs, are investigated by examining the results obtained by applying these methods for the move ordering in the endgame problems and some kinds of grandmasters' games. The cut-off by selecting the escape moves is relatively significant in the static positions such as opening, while the cut-off by selecting the capturing moves is greatly significant in the tactical positions.ゲームプログラミングワークショップ2001論文集2001141641672001-10-262014-01-06