完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | 曾汶傑 | en_US |
dc.contributor.author | 吳毅成 | en_US |
dc.date.accessioned | 2014-12-12T01:19:16Z | - |
dc.date.available | 2014-12-12T01:19:16Z | - |
dc.date.issued | 2008 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#GT009555591 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/39543 | - |
dc.description.abstract | 回溯分析演算法已經應用在許多棋類AI程式,中國象棋因為棋規問題無法直接套用傳統的回溯分析演算法,最近幾年方浩任等人研究出建立包含亞洲棋規的象棋殘局庫,使象棋殘局庫變的完整。為了提升象棋AI程式的棋力,需要花費的大量的時間與空間來建立象棋殘局庫。 本篇論文研究象棋殘局庫,利用象棋的兵卒走法的特性分割象棋殘局庫,並提出使用映射法進一步壓縮象棋殘局庫,最後評估不同方法對於象棋殘局庫的建立時間與使用空間的影響。 | zh_TW |
dc.description.abstract | Chinese Chess endgame databases including Asia Rule were constructed several years ago. In order to enhance Chinese Chess AI program at the endgame stage, it needs to spend a lot of time and space to create Chinese Chess endgame databases. This paper uses the characteristic of pawn of Chinese Chess to split Chinese Chess endgame databases and then use a mapping technique to compress them. And evaluate the impact of the time and space cost in different methods for the construction of them. | en_US |
dc.language.iso | zh_TW | en_US |
dc.subject | 電腦象棋 | zh_TW |
dc.subject | 殘局庫 | zh_TW |
dc.subject | 人工智慧 | zh_TW |
dc.subject | computer Chinese chess | en_US |
dc.subject | endgame database | en_US |
dc.subject | artificial intelligence | en_US |
dc.title | 象棋殘局庫之研究 | zh_TW |
dc.title | The Study of Chinese Chess Endgame Databases | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
顯示於類別: | 畢業論文 |