井字棋 α-β剪枝算法
在简单的游戏中，能够从当前游戏状态出发，搜索游戏的博弈树并确定最优行动方案的算法是存在的。其中最有名的算法就是极小极大算法。对于简单的双人游戏，极小极大算法很有用。它是在轮流行动的游戏中选择最好的行动的一种方法。

　　　在博弈树中的每一个结点（一个结点表示一个可能的行动方案）都可以保存一个值，该值用来定义对应行动在帮助玩家获胜方面的优良程度。因此，对于一个确定的结点，其子结点都有一属性来定义对应行动的相对优良程度。

　　 井字棋其实就是三子棋(和五子棋类似，只是3个相连获胜)，它的棋盘只有3*3(Alpha beta pruning algorithm for tic tac toe
In a simple game, the algorithm that searches the game tree from the current game state and determines the optimal action scheme exists. One of the most famous algorithms is minimax algorithm. Minimax algorithms are useful for simple double games. It's one of the best ways to choose the best action in a game of action.



Each node in a game tree (a node represents a possible action plan) can store a value that defines the goodness of the corresponding action in helping the player win. Therefore, for a definite node, its sub node has an attribute to define the relative degree of good action.



Well character chess is actually the game (and only 3 linked similar 331, winning the chessboard, only 3*3))