Adversarial Search
A
Maximizing the minimum gain
B
Minimizing the maximum loss
C
Maximizing the maximum gain
D
Minimizing the minimum loss
Correct Answer
Minimizing the maximum loss
A
Increase the depth of the search tree
B
Reduce the number of nodes evaluated in the minimax algorithm
C
Increase the branching factor
D
Solve constraint satisfaction problems
Correct Answer
Reduce the number of nodes evaluated in the minimax algorithm
ABreadth-first search
BDepth-first search
CMinimax algorithm
DGreedy search
Correct AnswerMinimax algorithm
AImprove the heuristic function
BReduce the computation time in adversarial search
CIncrease the accuracy of the evaluation function
DSolve CSPs
Correct AnswerReduce the computation time in adversarial search
AThe best value for the maximizing player
BThe best value for the minimizing player
CThe worst value for the maximizing player
DThe worst value for the minimizing player
Correct AnswerThe best value for the maximizing player
ATwo players with opposing goals
BPerfect information
CRandomness in outcomes
DZero-sum game
Correct AnswerRandomness in outcomes
AMinimize the opponent's score
BMaximize their own score
CMinimize their own score
DMaximize the opponent's score
Correct AnswerMaximize their own score
AThe game tree is shallow
BThe game tree is deep and wide
CThe evaluation function is inaccurate
DThe game is non-zero-sum
Correct AnswerThe game tree is deep and wide
AIt always evaluates all nodes in the game tree
BIt guarantees the same result as the minimax algorithm
CIt increases the branching factor
DIt is only applicable to constraint satisfaction problems
Correct AnswerIt guarantees the same result as the minimax algorithm
ADetermine the utility of terminal states
BEstimate the desirability of non-terminal states
CSolve CSPs
DPerform constraint propagation
Correct AnswerEstimate the desirability of non-terminal states
Constraint Satisfaction Problems (CSPs)
AVariables, domains, and constraints
BVariables, heuristics, and goals
CVariables, actions, and rewards
DVariables, states, and transitions
Correct AnswerVariables, domains, and constraints
AA depth-first search with constraint propagation
BA breadth-first search with heuristic evaluation
CA greedy search with random restarts
DA local search with simulated annealing
Correct AnswerA depth-first search with constraint propagation
AReduce the search space by enforcing constraints
BIncrease the branching factor
CRandomize the search process
DSolve adversarial search problems
Correct AnswerReduce the search space by enforcing constraints
AConstraint propagation
BAlpha-Beta pruning
CPropositional logic
DMinimax search
Correct AnswerConstraint propagation
ABacktracking search
BLocal search
CAlpha-Beta pruning
DConstraint propagation
Correct AnswerAlpha-Beta pruning
AAn assignment of values to variables that satisfies all constraints
BA sequence of actions leading to a goal state
CA heuristic evaluation of the search space
DA random assignment of values to variables
Correct AnswerAn assignment of values to variables that satisfies all constraints
AVariable ordering in CSPs
BValue ordering in CSPs
CConstraint propagation
DLocal search
Correct AnswerVariable ordering in CSPs
AComplete but not optimal
BOptimal but not complete
CNeither complete nor optimal
DBoth complete and optimal
Correct AnswerNeither complete nor optimal
AA constraint graph
BA game tree
CA decision tree
DA state-space graph
Correct AnswerA constraint graph
AThey are always solved using backtracking
BThey can be solved using local search techniques
CThey are only applicable to adversarial search problems
DThey require a heuristic function for solving
Correct AnswerThey can be solved using local search techniques
Knowledge-Based Agents & Propositional Logic
APropositional logic to represent knowledge
BAdversarial search to make decisions
CCSPs to solve problems
DLocal search to find solutions
Correct AnswerPropositional logic to represent knowledge
AA declarative statement that is either true or false
BA variable that can take any value
CA constraint that must be satisfied
DA heuristic function
Correct AnswerA declarative statement that is either true or false
AA knowledge-based agent
BA constraint satisfaction problem
CAn adversarial search problem
DA local search problem
Correct AnswerA knowledge-based agent
AA formal system for representing knowledge
BA search algorithm
CA heuristic function
DA constraint propagation technique
Correct AnswerA formal system for representing knowledge
APropositional theorem proving
BAdversarial search
CConstraint satisfaction problems
DLocal search
Correct AnswerPropositional theorem proving
APropositional logic
BFirst-order logic
CConstraint satisfaction problems
DAdversarial search
Correct AnswerPropositional logic
AA data-driven inference method
BA goal-driven inference method
CA constraint propagation technique
DA local search algorithm
Correct AnswerA data-driven inference method
AA goal-driven inference method
BA data-driven inference method
CA constraint propagation technique
DA local search algorithm
Correct AnswerA goal-driven inference method
AVerify the correctness of logical formulas
BSolve CSPs
CPerform adversarial search
DImplement local search
Correct AnswerVerify the correctness of logical formulas
ALogical inference to make decisions
BHeuristic functions to evaluate states
CConstraint propagation to solve problems
DLocal search to find solutions
Correct AnswerLogical inference to make decisions
Fill in the Blanks
31
In adversarial search, the __________ algorithm is used to find the optimal decision.
Correct Answerminimax
32
Alpha-Beta pruning improves the efficiency of the __________ algorithm.
Correct Answerminimax
33
The value of alpha represents the best value for the __________ player.
Correct Answermaximizing
34
The value of beta represents the best value for the __________ player.
Correct Answerminimizing
35
In a zero-sum game, one player's gain is the other player's __________.
Correct Answerloss
36
The evaluation function in adversarial search estimates the __________ of a game state.
Correct Answerdesirability
37
Alpha-Beta pruning eliminates branches that cannot influence the __________ decision.
Correct Answerfinal
38
The minimax algorithm assumes that both players play __________.
Correct Answeroptimally
39
In Alpha-Beta pruning, if alpha >= beta, the branch is __________.
Correct Answerpruned
40
Imperfect real-time decisions are made using __________ evaluation functions.
Correct Answerheuristic
41
A CSP consists of variables, domains, and __________.
Correct Answerconstraints
42
Backtracking search is a __________ search algorithm for solving CSPs.
Correct Answerdepth-first
43
Constraint propagation reduces the search space by enforcing __________.
Correct Answerconstraints
44
The __________ heuristic selects the variable with the fewest legal values.
Correct Answerminimum remaining values (MRV)
45
The __________ heuristic chooses the value that least constrains future choices.
Correct Answerleast constraining value (LCV)
46
Local search for CSPs is __________ but not complete.
Correct Answerefficient
47
The structure of a CSP can be represented as a __________ graph.
Correct Answerconstraint
48
The arc consistency algorithm ensures that all constraints are __________.
Correct Answersatisfied
49
In CSPs, a solution is an assignment of values to variables that satisfies all __________.
Correct Answerconstraints
50
The __________ algorithm is used to solve CSPs using local search.
Correct Answermin-conflicts
51
A knowledge-based agent uses __________ to represent knowledge.
Correct Answerpropositional logic
52
In propositional logic, a __________ is a declarative statement that is either true or false.
Correct Answerproposition
53
The Wumpus World is an example of a __________ agent.
Correct Answerknowledge-based
54
Propositional logic is a formal system for representing __________.
Correct Answerknowledge
55
Proof by __________ is a method used in propositional theorem proving.
Correct Answerresolution
56
__________ clauses are a subset of propositional logic with at most one positive literal.
Correct AnswerHorn
57
__________ chaining is a data-driven inference method.
Correct AnswerForward
58
__________ chaining is a goal-driven inference method.
Correct AnswerBackward
59
Effective propositional model checking verifies the correctness of __________ formulas.
Correct Answerlogical
60
Agents based on propositional logic use __________ to make decisions.
Correct Answerlogical inference