人工智能博弈树，采用极大极小搜索和α-β剪枝算法，搜索深度为2的棋盘博弈-Artificial intelligence game tree, using the minimax search with alpha beta pruning algorithm, the search depth is a chessboard game of 2

游戏树在人工智能的应用相当重要，若要寻找某赛局中最佳的步法的一个方式，是利用极小化极大算法在游戏树中搜寻最佳解，例如在井字游戏中电脑可以很快速地找到最佳解并做出决策。-Application of artificial intelligence in the game tree is very important, to find an innings in a manner best step is to use Minimax in the game tree search for the