毕业论文-基于分支限界法的连连看局域网对战游戏的开发【完稿】.docxVIP

本科毕业论文（设计）题 目基于分支限界法的连连看局域网对战游戏的开发作 者学 院信息科学与工程学院专 业计算机科学与技术学 号指导教师二〇一三年五月十五日摘 要分支限界法是一种广泛使用的状态空间搜索算法，这种算法常以广度优先或以最小耗费（最大效益）优先的方式来搜索问题的状态空间，在搜索过程中，利用剪枝来提高搜索效率，分支限界法与回溯法、A*算法等常用于游戏中的“寻路”过程。面向对象（Object-oriented，OO）开发方法是目前业界推崇的软件开发方法，使用面向对象开发方法能更好地适应当前的需求变化，容易实现软件复用性、可维护性、可修改性和可扩充性。连连看游戏是一种简单但不失趣味性的大众游戏，具有一定的数学性和动态性，而将普通的传统单机游戏扩充为局域网上的多人对战游戏，能使传统游戏更具备对抗性和刺激性。本文研究以面向对象技术为主要开发方法，以分支限界法作为两张游戏牌的寻路算法，将传统的连连看单机游戏扩充为局域网上的双人对战游戏，重点阐述了分支限界法与面相对象开发思想在连连看局域网对战游戏中的应用。程序开发出来后，不仅正确实现了相关的功能和性能，而且具有良好的稳定性、可维护性和可扩充性，证明了分支限界法和面向对象技术在在连连看局域网对战游戏开发中的可行性。关键词：状态空间; 分支限界法; 连连看; 面向对象; 套接字AbstractBranch and bound method is an algorithm that used widely in state-space search. This algorithm based on breadth-first or with the way (maximum benefit) in favor of smallest cost to search the problem in State space . During the search ,pruning is used to improve the search efficiency . The branch and bound method , the backtrack method ,and the A* algorithm is commonly used in the games of path finding process.Object-oriented (Object-oriented, OO) development methods are industry respected software development methods. Object-oriented development methods can better adapt to change in demand, easy to implement software reusability, maintainability, Modifiability, and scalability.Lianliankan games is a simple yet fun popular games, with a certain mathematical and dynamical .while the expansion of the common traditional games for multiplayer fighting game on the LAN, make the traditional game have a confrontational and provocative. This articles’ research use the object-oriented technology as the main development methods and take the branch and bound method as two game pathfinding algorithms. The traditional lianliankan games expanded into a double play against the game on the LAN ,focused on the application of branch and bound method and the object-oriented development methods in the LAN battle game. The developed program not only implement the functionality and performance properly, but also has good s