基于博弈树的AI五子棋实现(网络工程专业).docxVIP

PAGE 29 摘 要 五子棋是一种简单且娱乐性较强的大众化游戏。但是在比赛和大众之间的流传度不是很高，为了解决玩家之间对战水平不够高，五子棋的挑战性还有待提高这个问题，我设计了这个基于博弈树算法的AI五子棋游戏，让玩家能够体验跟AI对战的压迫感和挑战性。 本设计的实现采取调用python语言的graphics图形模块库来规划出该游戏程序的大小，定义为16×16的棋盘，然后用range函数划定棋盘。每次下棋所点击的位置通过判定落子位置是否在x≥0且≤15范围内以判断是否落子有效。应用tkinter类库实现弹窗设计，以完成计分板与计分系统。通过仿真双方轮流在棋盘上下棋，电脑方结合三层博弈树算法的极大极小值剪枝，通过博弈树搜索出最优的落子位置，实现电脑方成为一个智能化的对手。与普通五子棋游戏的人机模式相比，智能化人机明显更具可玩性和挑战性，更加受到大众的青睐。 关键词：五子棋；人工智能；博弈论；极大极小搜索 Abstract Gobang is a simple and entertaining popular game.However, the popularity between the game and the public is not very high. In order to solve the problem that the level of fighting between players is not high enough and the challenge of gobang still needs to be improved, I designed the game of AI gobang based on the game tree algorithm, so that players can experience the pressure and challenge of fighting against AI. The design of the implementation of the use of calling python language graphics module library to plan the size of the game program, defined as a 16×16 board, and then use the range function to delimit the board.The position clicked in each chess game determines whether the position of the drop is within the range of x≥0 and ≤15 to determine whether the drop is valid.Tkinter class library is applied to realize the popover design to complete the scoreboard and scoring system.By simulating the two sides playing chess in turn on the board, the computer side combined with the minimax pruning of the three-layer game tree algorithm, through the game tree to search for the optimal position, the computer into an intelligent opponent.Compared with the man-machine mode of general gobang game, intelligent man-machine is obviously more playable and challenging, and is more favored by the public. Key words: gobang; artificial? intelligence; game theory; Minimax search 目录 TOC \o 1-3 \h \z \u 第一章 绪论 1 1.1 研究背景 1 1.2 研究意义 1 1.3 博弈思想 2 1.3.1 博弈的定义 2 1.3.2 博弈的要素和特点 2 1.4 基本目标和主要内容 3 第二章 程序开发环境的介绍 5 2.1 程序开发语言 5 2.2 运行环境 5