adplus-dvertising

Discussion Forum

Que. The initial state and the legal moves for each side define the __________ for the game.
a. Search Tree
b. Game Tree
c. State Space Search
d. Forest
Answer:Game Tree
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

What are not present in finish actions?
What is the other name for forward state-space search?
Adversarial search problems uses
Following is/are the components of the partial order planning.
To which depth does the alpha-beta pruning can be applied?
How many ways are available to solve the state-space search?
What are present in the empty plan?
Where does the values of alpha-beta search get updated?
What is the advantage of totally ordered plan in constructing the plan?
Which cannot be taken as advantage for totally ordered plan search?
What is the other name of backward state-space search?
General games involves
Which values are independent in minimax search algorithm?
Which search is similar to minimax search?
Which value is assigned to alpha and beta in the alpha-beta pruning?
What is called as transposition table?
Which approach is to pretend that a pure divide and conquer algorithm will work?
General algorithm applied on game tree for making decision of win/lose is ____________.
Which is identical to the closed list in Graph search?
What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.