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
Q. Using the following given inorder and preorder traversal reconstruct a binary tree Inorder sequence is D, G, B, H, E, A, F, I, C

Design  and implement  an algorithm  to simulate car  re-organizing of the train at the railway switching junction. You can only use stacks as the data structure to represent the t

Demonstration of Polynomial using Linked List # include # include Struct link { Char sign; intcoef; int expo; struct link *next; }; Typedefstruct link

Binary tree creation struct NODE { struct NODE *left; int value; struct NODE *right; }; create_tree( struct NODE *curr, struct NODE *new ) { if(new->val

This notation bounds a function to in constant factors. We say f(n) = Θ(g(n)) if there presents positive constants n 0 , c 1 and c 2 such that to the right of n 0 the value of f

adjacency multilist

If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms? Your mission (sho

Ordinary variable An ordinary variable of a easy data type can store a one element only

One can change a binary tree into its mirror image by traversing it in Postorder is the only proecess whcih can convert binary tree into its mirror image.

Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine.    A n