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
Ruby implementation of the Symbol ADT Ruby implementation of the Symbol ADT, as mentioned, hinges on making Symbol class instances immutable that corresponds to the relative la

Q. Write down an algorithm to convert an infix expression into the postfix expression.     Ans. Algo rithm to convert infix expression to post fix expression is given as

RGB Model The RGB model is based on the assumption that any desired shade of colour can be obtained by mixing the correct amounts of red, green, and blue light. The exact hues

Draw trace table and determine output from the subsequent flowchart using below data:  X = 5, -3, 0, -3, 7, 0, 6, -11, -7, 12

Define Hashing. Store the following values in a hash table of table size 11 using division method: 25, 42, 96, 101, 102, 162, and 197. In case of collision, use other hash functio

Q. Let a binary tree 'T' be in memory. Write a procedure to delete all terminal nodes of the tree.       A n s . fun ction to Delete Terminal Nodes from Binary Tree

I need to know about data structure and algorithms. can you help me?

Q. Write down the algorithm which does depth first search through an un-weighted connected graph. In an un-weighted graph, would breadth first search or depth first search or neith

what are the charaterstics to determine weather an algorithm is good or not? explain in detail

Write down any four applications of the queues.                                                            Ans. A pp li cation of Queue is given below (i)  Queue is