3153

zero-sum, same

A [blank] game is one where the total payoff to all players is the [blank] for every instance of the game.

relaxed problem

A problem with fewer restrictions on the actions is called a [blank] [blank]

Chemistry

According to the textbook, which one of the following is not one of the foundations of AI?

overestimates, goal

An admissible heuristic is one that never [blank] the cost to reach the [blank].

true

An axiom is a sentence that is taken as given, without having to derive it from other sentences.

Yes

Assume that a player has a better choice m either at the parent node of some node n in the game tree or at any choice point further up in the tree (closer to the root). Can node n be pruned by the search algorithm?

True

Every consistent heuristic is also admissible.

rational agent

For each possible percept sequence, a(n) [blank] [blank] should select an action that is expected to maximize its performance metric, given the evidence provided by the percept sequence and whatever built-in knowledge the agent has.

states, moves

In a game tree, nodes represent game [blank] and edges represent [blank]

Iterative deepening

In general, [blank] [blank] is the preferred uninformed search method when the search space is large and the depth of the solution is not known.

abstraction

In problem-solving, details that are not necessary for the solution of the problem can be eliminated. This process is known as [blank]

abstract mathematical description

In the context of AI, an agent function is a(n)

True

In the context of problem-solving agents, if we assume that the environment is observable, discrete, known and deterministic, the solution to any problem is a fixed sequence of actions.

lowest, priority

In uniform-cost search, the algorithm expands the node n with [blank] the path cost g(n). This is done by storing the frontier as a [blank] queue ordered by g.

False

Iterative deepening search is wasteful because states are generated multiple times.

State, unobserved

Model-based reflex agents maintain an internal [blank] that depends on the percept history and reflects some of the [blank] aspects of the current state of the environment.

Dartmouth College

Name the institution that is considered the official birthplace of AI

Breadth-first search

Name the search strategy in which in which the root node is expanded first, then all the successors of the root node are expanded next, then their successors, and so on.

Depth-First search

Name the search strategy which always expands the deepest node in the current frontier of the search tree.

Order

Queues are characterized by the [blank] in which they store the inserted nodes.

search tree

Search algorithms work by considering various possible action sequences. The possible action sequences starting at the initial state form a [blank] [blank]

True

Simple reflex agents are very simple, but their intelligence is very limited.

memory

The SMA* algorithm is similar to A*; but it expands the best leaf until it runs out of ___________. At this point, it deletes the worst leaf node.

knowledge base

The central component of a knowledge-based agent is its [blank] [blank]

Acting Rationally

The chapter discusses four general approaches to AI, which one does the textbook focus on?

False

The cost of an optimal solution to a relaxed problem is not an admissible heuristic for the original problem.

alpha-beta, order

The effectiveness [blank] of pruning is highly dependent on the [order] in which the states are examined.

goal formulation

The first step in problem solving is [blank] [blank].

percepts, actions

The job of Artificial Intelligence is to design an agent program that implements the agent function, i.e., a mapping from [blank] to [blank].

current, successor

The minimax algorithm computes the minimax decision from the [blank] state, by computing the minimax values of all the [blank] states.

False

The minimax algorithm is not recursive.

False

The notion of agent is meant to be an absolute characterization that divides the world into agents and non-agents.

false

The table-driven approach to agent construction is so simple and easy to implement that it is guaranteed to succeed.

the fact that branches of the search tree can be eliminated giving you deeper search.

What is the main benefit of using alpha-beta pruning over minimax?

The amount of space (memory) it uses

What is the main drawback of A* search? Select the most precise answer.

The Turing Test

What is the name of the approach proposed in 1950 to provide a satisfactory operational definition of intelligence?

Bayes

What is the name of the rule that underlies most modern approaches to uncertain reasoning in AI systems?

declarative

What type of approach to system building is being followed when a knowledge-based agent is built simply by telling it what it needs to know, one sentence at a time, until it knows how to operate in its environment?

Nondeterministic

What type of task environment can be best described as one in which actions are characterized by their possible outcomes, but no probabilities are attached to them?

Acting Rationally

Which of the following approaches to AI is more suitable for scientific methods and computationally-based solutions?

The initial state The set of possible actions A path cost function A goal test A description of what each available action does

Which of the following are key components in the formal definition of a problem. Select all correct answers.

Finite state machine-based agents, Deep learning-based agents

Which of the following are not one of the kind of agent programs specifically discussed in the reading?

autonomy

Which of the terms listed below best matches the following definition: A rational agent should learn what it can to compensate for partial or incorrect prior knowledge.

Utility-based agent

Which one of the agent types listed below is described in the following sentence: A rational agent designed to choose the action which maximizes the utility it expects to derive, on average, given the probabilities and utilities of each outcome.

is for AI to prove to us humans that they are also humans or similar enough to think, better interactions, and better problem solving.

Why is the Turing Test significant in the field of AI?

problem formulation

[blank] [blank] is the process of deciding what actions and states to consider, given a goal.

informed search

[blank] [blank] strategies use problem-specific knowledge to find solutions more efficiently than uninformed strategies can.