The game tree, Data Structure & Algorithms

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

1824_tic tac toe.png

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







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
Related Questions
Given a number that is represented in your data structure, you will need a function that prints it out in base 215 in such a way that its contents can be checked for correctness. Y

What are the things require to implement ADT Abstract data types are very useful for helping us understand the mathematical objects which we use in our computations but, of cou

Comparison of Gouraud and Phong Shading Phong shading requires more calculations, but produces better results for specular reflection than Gouraud shading in the form of more r

Q. Give the adjacency matrix for the graph drawn below:                                                 Ans: Adjacency matrix for the graph given to us

How will you represent a max-heap sequentially? Max heap, also known as the descending heap, of size n is an almost complete binary tree of n nodes such that the content of eve

Asymptotic notation Let us describe a few functions in terms of above asymptotic notation. Example: f(n) = 3n 3 + 2n 2 + 4n + 3 = 3n 3 + 2n 2 + O (n), as 4n + 3 is of

Define a sparse metrics. A matrix in which number of zero entries are much higher than the number of non zero entries is known as sparse matrix. The natural method of showing m

Q. Explain the complexity of an algorithm?  What are the worst case analysis and best case analysis explain with an example.

how to learn about time complexity of a particular algorithm

Primitive Data Structure These are the basic structure and are directly operated upon by the machine instructions. These in general have dissimilar representations on different