五子棋的核心算法 五子棋是一种受大众广泛喜爱的游戏，其规则简单，变化多端，非常富有趣味性和消遣 性。这里设计和实现了一个人机对下的五子棋程序，采用了博弈树的方法，应用了剪枝 和最大最小树原理进行搜索发现最好的下子位置。介绍五子棋程序的数据结构、评分规 则、胜负判断方法和搜索算法过程。-331 of 331 core algorithm is a widely loved by the public of the game, its rules simple and changeable, very rich and interesting recreational. Here the design and realization of a human-machine right under the 331 procedures using the Game trees, pruning and application of the largest and most trees principle Search Now found the best location. Renju procedures introduced the data structure, score rules, methods and judgment of the outcome search algorithm process.