發(fā)布時(shí)間：2018-03-19 22:15

  本文選題：中國象棋　切入點(diǎn)：人機(jī)博弈　出處：《武漢科技大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

【摘要】：人工智能的應(yīng)用范圍非常廣泛，計(jì)算機(jī)博弈（也稱機(jī)器博弈）被認(rèn)為是該領(lǐng)域最具挑戰(zhàn)性的研究方向之一。人類在對(duì)計(jì)算機(jī)博弈研究取得成果的同時(shí)，極大地推動(dòng)了人工智能的發(fā)展。棋類博弈作為計(jì)算機(jī)博弈的代表，對(duì)其研究顯得尤為重要。在中國象棋的人機(jī)博弈中，如何使計(jì)算機(jī)更快更具有殺傷力地同人類對(duì)戰(zhàn)以達(dá)到最終戰(zhàn)勝人類的目的，是目前該領(lǐng)域研究的熱點(diǎn)問題。 本文詳細(xì)地介紹了構(gòu)建計(jì)算機(jī)博弈系統(tǒng)的相關(guān)技術(shù)——數(shù)據(jù)結(jié)構(gòu)、著法生成以及局面評(píng)估方式。重點(diǎn)介紹了計(jì)算機(jī)博弈系統(tǒng)的搜索算法，包括基礎(chǔ)的極大極小算法、alpha-beta算法以及高級(jí)搜索算法比如PVS、靜寂搜索以及空著裁剪等，，并通過分析表明著法順序會(huì)影響對(duì)博弈樹結(jié)點(diǎn)的搜索。 一個(gè)完整的計(jì)算機(jī)博弈系統(tǒng)包括界面設(shè)計(jì)和搜索引擎兩大部分。論文選擇了合適的數(shù)據(jù)結(jié)構(gòu)，通過比較采用模版匹配法生成所有著法，綜合考慮棋子自身價(jià)值和棋子所處位置兩方面的因素得到棋子子力價(jià)值表并作為局面評(píng)估的依據(jù)，并對(duì)各類搜索算法適當(dāng)組合，共同完成了搜索引擎部分。最后，基于Android開發(fā)平臺(tái)，成功地搭建了中國象棋的計(jì)算機(jī)博弈系統(tǒng)。并在該系統(tǒng)中測(cè)試了各組合算法在不同的搜索深度下搜索的結(jié)點(diǎn)數(shù)以及耗費(fèi)的時(shí)間。實(shí)驗(yàn)證明采用啟發(fā)算法比如置換表、歷史表、殺手啟發(fā)在搜索展開前優(yōu)化著法順序可以提高搜索效率，將高級(jí)搜索算法同啟發(fā)算法相結(jié)合形成的算法搜索效率較高。
[Abstract]:The application of artificial intelligence is very extensive, computer game (also known as machine game) is regarded as one of the most challenging research directions in this field. As the representative of computer game, it is very important to study chess game. How to make the computer fight with human beings more quickly and hurtlessly in order to win the final victory is a hot issue in this field. This paper introduces in detail the related technology of constructing computer game system-data structure, method generation and situation evaluation method, especially the search algorithm of computer game system. It includes the basic Maxima beta algorithm and advanced search algorithms such as PVS, silent search and empty clipping. The analysis shows that the order of the algorithm will affect the search of game tree nodes. A complete computer game system consists of two parts: interface design and search engine. Considering the value of the pieces themselves and the position of the pieces, the value table of the force of the pieces is obtained and used as the basis for the evaluation of the situation, and the search engine part is completed together by the proper combination of all kinds of search algorithms. Based on Android development platform, The computer game system of Chinese chess is successfully built, and the number of nodes and the time consumed by each combination algorithm under different search depth are tested in this system. The experiment proves that heuristic algorithms such as permutation table, history table, etc. The search efficiency can be improved by optimizing the algorithm sequence before the search is unfolded, and the search efficiency is higher by combining the advanced search algorithm with the heuristic algorithm.
【學(xué)位授予單位】：武漢科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP18

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 王曉鵬;王驕;徐心和;鄭新穎;;中國象棋與國際象棋比較分析[J];重慶工學(xué)院學(xué)報(bào)(自然科學(xué)版);2007年01期

2 邢森;;五子棋智能博弈的研究與設(shè)計(jì)[J];電腦知識(shí)與技術(shù);2010年13期

3 陳業(yè)鵬;;基于Alpha-Beta搜索算法的中國象棋人機(jī)對(duì)戰(zhàn)的設(shè)計(jì)與實(shí)現(xiàn)[J];計(jì)算機(jī)光盤軟件與應(yīng)用;2012年04期

4 王賀;劉知青;;基于Android的圍棋游戲開發(fā)[J];計(jì)算機(jī)光盤軟件與應(yīng)用;2012年22期

5 周瑋;王水濤;孫e

本文編號(hào)：1636197