An interesting application or implementation of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc.

We can depict the sequence of possible moves by mean of a game tree in which the root signifies the initial situation and the branches from the root signifies the legal moves that the first player could make. At the next level down, the branches corresponds to the legal move by the second player in condition and so on, with branches from vertices at even levels signifying the moves by the 1st player and from the vertices at odd levels depicting the moves by the 2nd player.

Eg. Tic-tac-toe

Posted Date: 7/12/2012 8:49:48 AM | Location : United States

Ask an Expert

Related Discussions:- The game tree, Assignment Help, Ask Question on The game tree, Get Answer, Expert's Help, The game tree Discussions

Write discussion on The game tree
Your posts are moderated

Write your message here..

Related Questions

Define spanning tree, Define Spanning Tree A Spanning Tree of a connect... Define Spanning Tree A Spanning Tree of a connected graph is its linked acyclic sub graph (i.e., a tree) that having all the vertices of the graph.

Size of stack, The size of stack was declared as ten. Thus, stack cannot ho... The size of stack was declared as ten. Thus, stack cannot hold more than ten elements. The major operations which can be performed onto a stack are push and pop. However, in a prog

Comparisions and assignments in worst case, Q. Calculate that how many key ... Q. Calculate that how many key comparisons and assignments an insertion sort makes in its worst case?        Ans: The worst case performance occurs in insertion

Differentiate between nonpersistent and 1-persistent, Differentiate between... Differentiate between Nonpersistent and 1-persistent Nonpersistent: If the medium is idle, transmit; if the medium is busy, wait an amount of time drawn from a probability dist

Data structures, I am looking for assignment help on the topic Data Structu... I am looking for assignment help on the topic Data Structures. It would be great if anyone help me.

Cohen sutherland algorithm, Using the cohen sutherland. Algorithm. Find the... Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Define complete binary tree, Define Complete Binary Tree Complete Binar... Define Complete Binary Tree Complete Binary Tree:- A whole binary tree of depth d is that strictly binary tree all of whose leaves are at level D.

Non-recursive algorithm to traverse a tree in preorder, Write the non-recur... Write the non-recursive algorithm to traverse a tree in preorder.    The Non- Recursive algorithm for preorder traversal is as follows: Initially  push NULL onto stack and

Insertion of a node into an avl tree, Initially Nodes are inserted in an AV... Initially Nodes are inserted in an AVL tree in the same manner as an ordinary binary search tree. Though, the insertion algorithm for any AVL tree travels back along with the pa

#stone game\.c, stone game in c programming stone game in c programming