Hello guys. This is an important topic . After this topic i will describe another two very interesting topics (Mini-Max Algorithm in Artificial Intelligence , Alpha-beta pruning ) I hope this tutorial will be useful to many.
Game Trees
- are used to represent two-player games.
- Nodes in the tree represent positions.
- Edges between nodes represent moves.
- Leaf nodes represent won, lost or drawn positions.
We all played a simple game Tic Tac Toe . Only two player can play this game at a time.. but when we played this game against Computer. Then how did it give its move?. This think is very important. It give its move with the help of this game trees.
this video can help you to understand more:
in the video you guys saw that it looked like a tree. so it is called game trees. For your basic this all moves are saved in Database. AI give his moves according to our moves.
i think this picture can help you more:
Here ,
- +1 if the position is a win for X.
- -1 if the position is a win for O.
- 0 if the position is a draw.