WEKO3
アイテム
Efficient Time Control in Chinese Chess with Alternating Search
https://ipsj.ixsq.nii.ac.jp/records/91359
https://ipsj.ixsq.nii.ac.jp/records/91359fe1a1adc-6d0b-434d-810f-0aa09266f44e
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2012 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Symposium(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2012-11-09 | |||||||
タイトル | ||||||||
タイトル | Efficient Time Control in Chinese Chess with Alternating Search | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | Efficient Time Control in Chinese Chess with Alternating Search | |||||||
言語 | ||||||||
言語 | eng | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||||
資源タイプ | conference paper | |||||||
著者所属 | ||||||||
Tokyo University of Technology, Graduate School of Bionics, Computer and Media Sciences, Computer Science Program | ||||||||
著者所属 | ||||||||
Tokyo University of Technology, School of Computer Science | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Tokyo University of Technology, Graduate School of Bionics, Computer and Media Sciences, Computer Science Program | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Tokyo University of Technology, School of Computer Science | ||||||||
著者名 |
Jiqing, Xun
× Jiqing, Xun
|
|||||||
著者名(英) |
Xun, Jiqing
× Xun, Jiqing
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | Time control is an important strategy problem in games. With a good strategy, time can be used more efficiently, using more time for more important decisions. In computer games, a good strategy can provide more time for certain moves, thus allowing deeper search which results in better moves. Furthermore, a good strategy should be adaptive so it can be used in different contexts. In this paper, we propose a new method to improve the efficiency of time control by adjusting the search depth according to the game stage and the time that is left. The experimental results show that the proposed method may be a suitable way to use time more efficiently. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | Time control is an important strategy problem in games. With a good strategy, time can be used more efficiently, using more time for more important decisions. In computer games, a good strategy can provide more time for certain moves, thus allowing deeper search which results in better moves. Furthermore, a good strategy should be adaptive so it can be used in different contexts. In this paper, we propose a new method to improve the efficiency of time control by adjusting the search depth according to the game stage and the time that is left. The experimental results show that the proposed method may be a suitable way to use time more efficiently. | |||||||
書誌情報 |
ゲームプログラミングワークショップ2012論文集 巻 2012, 号 6, p. 141-143, 発行日 2012-11-09 |
|||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 情報処理学会 |