- Category:
- AI-NN-PR
- Tags:
-
- File Size:
- 1kb
- Update:
- 2017-10-26
- Downloads:
- 0 Times
- Uploaded by:
- 安抚
Description: 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)
To Search:
File list (Check if you may need any files):
Download