文化大學機構典藏 CCUR:Item 987654321/2473
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 46962/50828 (92%)
造访人次 : 12454043      在线人数 : 684
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于CCUR ‧ 管理 到手机版


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/2473


    题名: Computer Chinese chess
    作者: Yen S.J. , Chen J.C. , Yang T.N., Hsu S.C.
    贡献者: 資訊科學系
    日期: 2004
    上传时间: 2009-11-02 11:28:02 (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 v.27 n.1 Pages: 3-18
    显示于类别:[資訊工程學系] 期刊論文

    文件中的档案:

    没有与此文件相关的档案.



    在CCUR中所有的数据项都受到原著作权保护.

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