English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 46833/50693 (92%)
造訪人次 : 11868466      線上人數 : 544
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    主頁登入上傳說明關於CCUR管理 到手機版


    請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/2847


    題名: Computer Chinese chess
    作者: Yen SJ;Chen JC;Yang TN;Hsu SC
    貢獻者: 資科系
    日期: 2004
    上傳時間: 2009-11-23 11:37:57 (UTC+8)
    摘要: This article describes the current state of computer Chinese chess (Xiang Qi). For two reasons, Chinese-chess programming is important in the field of Artificial Intelligence. First, Chinese chess is one of the most popular and oldest board games worldwide; currently the strength of a Chinese-chess program can be compared to that of human players. Second, the complexity of Chinese chess is between that of chess and Go. We assume that after DEEP BLUE'S Victory over Kasparov in 1997, Chinese chess will be the next popular chess-like board game at which a program will defeat a human top player.
    In the article we introduce some techniques for developing Chinese-chess programs. In the Computer Olympiads of 2001 and 2002, the programs ELP and SHIGA were the top Chinese-chess programs. Although these two programs roughly have the same strength, they were developed following completely different techniques, as described in the article. The improvements of the best Chinese-chess programs over the last twenty years suggest that a human top player will be defeated before 2010.
    關聯: ICGA JOURNAL Volume: 27 Issue: 1 Pages: 3-18
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    沒有與此文件相關的檔案.



    在CCUR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋