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
#What is the pointer

Retrieval of information is made simpler when it is stored into some predefined order. Therefore, Sorting is a very important computer application activity. Several sorting algorit

Illustrates the program segment for Quick sort. It uses recursion. Program 1: Quick Sort Quicksort(A,m,n) int A[ ],m,n { int i, j, k; if m { i=m; j=n+1; k

Graph terminologies : Adjacent vertices: Two vertices a & b are said to be adjacent if there is an edge connecting a & b. For instance, in given Figure, vertices 5 & 4 are adj

Technique for direct search is    Hashing is the used for direct search.

Comparative Study of Linear and Binary Search Binary search is lots quicker than linear search. Some comparisons are following: NUMBER OF ARRAY ELEMENTS EXAMINED array

List various problem solving techniques. There are two techniques:- 1.  Top down 2.  Bottom- up


A freight train from Melbourne is approaching Sydney, carrying n cars of cargos. The cargos are to be delivered to n different cities in the metropolitan area of Sydney - one car f

Describe different methods of developing algorithms with examples.