ARTIFICIAL INTELLIGENCE
[ SUBJECT CODE: 2180703 ]
CH-3 GAME PLANNING
Topics Covers:-
Overview, MiniMax, Alpha-Beta Cut-off, Refinements, Iterative deepening, The Blocks World, Components Of A Planning System, Goal Stack Planning, Nonlinear Planning Using Constraint Posting, Hierarchical Planning, Reactive Systems, Other Planning Techniques.
MCQ:-
1.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
2. General algorithm applied on game tree for making decision of win/lose is ____________
a) DFS/BFS Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) MIN/MAX Algorithms
3.General games involves ____________
a) Single-agent
b) Multi-agent
c) Neither Single-agent nor Multi-agent
d) Only Single-agent and Multi-agent
4.How many ways are available to solve the state-space search?
a) 1
b) 2
c) 3
d) 4
5.What is the other name for forward state-space search?
a) Progression planning
b) Regression planning
c) Test planning
d) None of the mentioned
6.Which search is similar to minimax search?
a) Hill-climbing search
b) Depth-first search
c) Breadth-first search
d) All of the mentioned
7.Which value is assigned to alpha and beta in the alpha-beta pruning?
a) Alpha = max
b) Beta = min
c) Beta = max
d) Both Alpha = max & Beta = min
8.Which function is used to calculate the feasibility of whole game tree?
a) Evaluation function
b) Transposition
c) Alpha-beta pruning
d) All of the mentioned
9.What is called as transposition table?
a) Hash table of next seen positions
b) Hash table of previously seen positions
c) Next value in the search
d) None of the mentioned
10.Which search is equal to minimax search but eliminates the branches
that can’t influence the final decision?
a) Depth-first search
b) Breadth-first search
c) Alpha-beta pruning
d) None of the mentioned
11.Which is the most straightforward approach for planning algorithm?
a) Best-first search
b) State-space search
c) Depth-first search
d) Hill-climbing search
12.Mathematical game theory, a branch of economics, views any multi- agent environment as a game provided that the impact of each agent on the others is “significant,” regardless of whether the agents are cooperative or competitive.
a) True
b) False
13.Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same.
a) True
b) False
14.To which depth does the alpha-beta pruning can be applied?
a) 10 states
b) 8 States
c) 6 States
d) Any depth
15.Where does the values of alpha-beta search get updated?
a) Along the path of search
b) Initial state itself
c) At the end
d) None of the mentioned
16. Which values are independent in minimax search algorithm?
a)Pruned leaves x and y
b)Every state is dependent
c)Root is independent
d)None of the mentioned
17.Which is identical to closed list in Graph Search?
a)Hill climbing search algorithm
b)Depth- first search
c)Transposition table
d)None of the above
18. Which of the following is also called First order Logic?
a) Lower Order Calculus
b) First Order Predicate Calculus
c) Quantification Theory
d) All of these
19. Factoring means…
a) Removal of redundant literal
b) Removal of redundant variable
c) Addition of redundant variable
d) Addition of redundant literal
20. What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?
a) Success
b) Error
c) Compilation
d) Termination
0 Comments:
Post a Comment