劉邦鋒臺灣大學：資訊工程學研究所吳光哲Wu, Kuang-cheKuang-cheWu2007-11-262018-07-052007-11-262018-07-052005http://ntur.lib.ntu.edu.tw//handle/246246/54028電腦象棋發展至今，已有相當於象棋高段棋手的棋力。高手對局，象棋棋規的正確判斷與運用愈顯重要。然而至今未曾有公開的文獻提出完整且有效率的象棋棋規實作。本文實作完整的象棋棋規，並針對中局搜尋的循環局面歷史交互作用問題提出部份解決的策略。此處的象棋棋規採用亞洲象棋聯合會的象棋比賽規則。象棋棋規較西洋棋困難處在於循環局面的判決結果勝、負、和都有可能；而且得造成三次相同的循環條件才會輸棋，譬如一將一捉作和。西洋棋則一律視循環為和棋。The importance of mastering Chinese chess rules to improve the skills of Computer Chinese chess players is recognized by experts. However, we are not aware of any published results of a full implementation of Chinese chess rules with reasonable performance degradation. This paper reposts such an implementation and proposes some heuristics to deal the cyclic rules during search. The Chinese chess rules used to decide the outcome of a game when it falls into loops are those proposed by the Asia Chinese Chess Association. The Chinese chess rules for cyclic moves differ from Western chess rules in two regards. First the outcome of a cyclic game can either be win, loss or draw. Second, the same type of rule has to be violated three times in a row to lose the game. In other words, a player can violate different rules in three cycles to achieve a draw. In comparison, Western chess rules define a cyclic game as a draw.書名頁 i 論文口試委員審定書 i 中文摘要 ii 英文摘要 iii 誌謝 iv 目錄 v 表目錄 vii 圖目錄 viii 1 緒論 1 1.1 前言 1 1.2 論文架構 2 2 基礎理論與文獻探討 3 2.1 中局搜尋演算法 3 2.2 象棋棋規 6 2.2.1 棋規實例 13 2.3 Graph History Interaction 問題 16 3 解決 GHI 問題的一些策略 19 3.1 簡單策略 19 3.2 歷史路徑編碼 20 3.3 維護 GHI 影響分數的範圍 21 3.3.1 演算法流程 24 3.4 只求正確判斷輸贏循環 26 4 實作結果與討論 28 4.1 實驗設計 28 4.2 實驗結果 28 4.2.1 循環盤面測試 29 4.2.2 實戰對局盤面測試 31 4.3 象棋 GHI 實例 34 5 結論與未來發展 36 參考文獻 372381963 bytesapplication/pdfen-US搜尋圖歷史交互作用問題電腦象棋亞洲棋規Graph History InteractionComputer Chinese ChessAsia Chinese Chess rulethesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/54028/1/ntu-94-R92922030-1.pdf