本文選題：計(jì)算機(jī)博弈　切入點(diǎn)：搜索算法　出處：《沈陽工業(yè)大學(xué)》2012年碩士論文　論文類型：學(xué)位論文

【摘要】：計(jì)算機(jī)博弈是人工智能的一個(gè)傳統(tǒng)研究領(lǐng)域。計(jì)算機(jī)博弈為人工智能提供一個(gè)實(shí)驗(yàn)平臺(tái),將人工智能的一些理論與方法應(yīng)用于計(jì)算機(jī)博弈,可通過博弈水平的高低來檢驗(yàn)這些理論與方法的有效性,研究計(jì)算機(jī)博弈所得到的成果也可推廣至人工智能的其他領(lǐng)域。二者相輔相成,相互促進(jìn)。國際象棋計(jì)算機(jī)博弈已經(jīng)比較成熟,歷史悠久的中國象棋計(jì)算機(jī)博弈很多技術(shù)還不夠成熟,隨著對(duì)人工智能的深入研究,對(duì)中國象棋博弈的研究成為人工智能研究的熱點(diǎn)之一。 本文對(duì)中國象棋博弈樹搜索算法以及博弈系統(tǒng)進(jìn)行研究,介紹了中國象棋計(jì)算機(jī)博弈的關(guān)鍵技術(shù),分析了數(shù)據(jù)結(jié)構(gòu)設(shè)計(jì)和評(píng)估函數(shù)在系統(tǒng)中所起的作用。深入研究博弈樹的特性以及基于α-β剪枝的博弈樹搜索算法的改進(jìn)策略,包括窗口原則、歷史表法、置換表法、空著搜索等,結(jié)合不同的改進(jìn)策略得到不同的搜索引擎,對(duì)這些引擎的性能進(jìn)行測(cè)試,驗(yàn)證它們的剪枝效率。研究了靜態(tài)搜索,在靜態(tài)搜索中加入吃子走法排序和將軍延伸,解決了博弈樹搜索的水平效應(yīng)。 實(shí)現(xiàn)一個(gè)人機(jī)博弈系統(tǒng),實(shí)現(xiàn)生成并顯示棋譜,統(tǒng)計(jì)搜索引擎每次搜索的葉節(jié)點(diǎn)和所用的時(shí)間,結(jié)合不同的優(yōu)化策略得到不同的搜索引擎,通過實(shí)驗(yàn)證明綜合多種改進(jìn)策略的搜索算法的剪枝效率得到了提高。選取剪枝效率較高的搜索引擎結(jié)合靜態(tài)搜索提高棋力,讓這些新的搜索引擎對(duì)弈,證明了剪枝效率最高的PVSHNTIQ搜索算法的棋力也最高。
[Abstract]:Computer game is a traditional research field of artificial intelligence. Computer game provides an experimental platform for artificial intelligence, and applies some theories and methods of artificial intelligence to computer game. The validity of these theories and methods can be tested by the level of game, and the results of computer game can be extended to other fields of artificial intelligence. Mutual promotion. Chess computer game has been relatively mature, Chinese chess computer game has a long history of many technologies are not mature enough, with the in-depth study of artificial intelligence, The study of Chinese chess game has become one of the hotspots of artificial intelligence. This paper studies Chinese chess game tree search algorithm and game system, and introduces the key technology of Chinese chess computer game. This paper analyzes the function of data structure design and evaluation function in the system, deeply studies the characteristics of game tree and the improvement strategy of game tree search algorithm based on 偽-尾 pruning, including window principle, history table method, replacement table method, etc. Empty search, combined with different improved strategies to obtain different search engines, test the performance of these engines, verify their pruning efficiency. The horizontal effect of game tree search is solved. To realize a man-machine game system, to generate and display chess spectrum, to calculate the leaf nodes and the time used in each search engine, and to obtain different search engines by combining different optimization strategies. The experiment proves that the pruning efficiency of the search algorithm integrated with various improved strategies has been improved. The search engine with high pruning efficiency and static search is selected to improve the chess ability, so that these new search engines can play chess. It is proved that the PVSHNTIQ search algorithm, which has the highest pruning efficiency, has the highest chess power.
【學(xué)位授予單位】：沈陽工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類號(hào)】：TP391.3

【相似文獻(xiàn)】

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

1 趙偉;楊明;葉明;王國著;;全自動(dòng)細(xì)胞芯片檢測(cè)儀中自動(dòng)聚焦系統(tǒng)的研究[J];電子測(cè)量與儀器學(xué)報(bào);2011年08期

2 董西廣;張治國;張文欣;;Gnutella網(wǎng)絡(luò)中基于消息跳數(shù)的分段搜索策略[J];河南工程學(xué)院學(xué)報(bào)(自然科學(xué)版);2011年02期

3 楊艷;朱戈;范文彬;;一種基于文檔拓?fù)涞南嗨菩运阉魉惴╗J];計(jì)算機(jī)工程與應(yīng)用;2011年26期

4 賈彥國;紀(jì)永峰;任富爭;;差集偶搜索算法[J];燕山大學(xué)學(xué)報(bào);2011年04期

5 馬鴻旭;;基于變化步長的數(shù)字影像特征搜索算法[J];信息通信;2011年04期

6 葉漪;吳國文;羅辛;;一種帶有時(shí)間域的證書鏈搜索算法[J];計(jì)算機(jī)應(yīng)用與軟件;2011年09期

7 王琳霖;唐晨;;基于梯度法的數(shù)字散斑圖像相關(guān)亞像素搜索算法[J];光電技術(shù)應(yīng)用;2011年03期

8 邵國金;高俊;曾家國;;基于文件分類的非結(jié)構(gòu)化P2P網(wǎng)絡(luò)搜索算法[J];河南師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年05期

9 李林濤;朱珊虹;;基于Android系統(tǒng)的手機(jī)游戲黑白棋的設(shè)計(jì)與實(shí)現(xiàn)[J];新鄉(xiāng)學(xué)院學(xué)報(bào)(自然科學(xué)版);2011年03期

10 閻興，

本文編號(hào)：1562629