CS 380 - Midterm 1 || Error-free Answers 100%.
What is PEAS? correct answers Performance Measure, Environment, Actuators, Sensors
Chapter 2 - Intelligent Agents
What are the 6 different types of environments? correct answers 1. Fully vs Partially Observable
2. Single Agent vs Multi-Agent
3. Deterministic vs Stochastic
4. Episodic vs Sequential
5. Static vs Dynamic
6. Continuous vs Discrete
Chapter 2 - Intelligent Agents
What are the 4 components you need to formulate a problem? correct answers 1. State
Representation
2. Knowledge Base
3. Rules
4. Goal Condition
Chapter 2 - Intelligent Agents
What is state representation? correct answers What does a state look like?
What is the initial state?
Chapter 2 - Intelligent Agents
,What is a knowledge base? correct answers Besides the current state, what else is there to know
about the problem?
Chapter 2 - Intelligent Agents
What are rules? correct answers Preconditions and Actions.
Preconditions:
Is the rule applicable to the current state?
Actions:
What is the result when the rule is applied to the current state?
Chapter 2 - Intelligent Agents
What is a goal condition? correct answers The goal state that the current state needs to reach.
Chapter 3 - Solving Problems by Searching
What are the 2 basic approaches of solution strategies? correct answers Irrevocable and Tentative
Chapter 3 - Solving Problems by Searching
What is an irrevocable searching strategy? correct answers Keeps track of only the current state.
Applying rule r to state s produces new value of state s.
, When the algorithm completes, state s is the solution state.
Chapter 3 - Solving Problems by Searching
What is tentative searching strategy? correct answers Keep track of all moves from the start.
Doesn't actually apply a move, just tentatively apply, and if it doesn't work, try something else.
Rules that have been applied and didn't work may be revoked.
Chapter 3 - Solving Problems by Searching
What is an implicit graph? correct answers Begins with start node, build graph by choosing a
node and generating successors with a successor function.
The start node will be the initial state.
The successor function expands a node and applies applicable rules to state. The expanded node
is the parent and successors are children.
It is basically a tree.
Chapter 3 - Solving Problems by Searching
What are some irrevocable strategies? correct answers Flailing Wildly
Hill Climbing (And Variations)
What is PEAS? correct answers Performance Measure, Environment, Actuators, Sensors
Chapter 2 - Intelligent Agents
What are the 6 different types of environments? correct answers 1. Fully vs Partially Observable
2. Single Agent vs Multi-Agent
3. Deterministic vs Stochastic
4. Episodic vs Sequential
5. Static vs Dynamic
6. Continuous vs Discrete
Chapter 2 - Intelligent Agents
What are the 4 components you need to formulate a problem? correct answers 1. State
Representation
2. Knowledge Base
3. Rules
4. Goal Condition
Chapter 2 - Intelligent Agents
What is state representation? correct answers What does a state look like?
What is the initial state?
Chapter 2 - Intelligent Agents
,What is a knowledge base? correct answers Besides the current state, what else is there to know
about the problem?
Chapter 2 - Intelligent Agents
What are rules? correct answers Preconditions and Actions.
Preconditions:
Is the rule applicable to the current state?
Actions:
What is the result when the rule is applied to the current state?
Chapter 2 - Intelligent Agents
What is a goal condition? correct answers The goal state that the current state needs to reach.
Chapter 3 - Solving Problems by Searching
What are the 2 basic approaches of solution strategies? correct answers Irrevocable and Tentative
Chapter 3 - Solving Problems by Searching
What is an irrevocable searching strategy? correct answers Keeps track of only the current state.
Applying rule r to state s produces new value of state s.
, When the algorithm completes, state s is the solution state.
Chapter 3 - Solving Problems by Searching
What is tentative searching strategy? correct answers Keep track of all moves from the start.
Doesn't actually apply a move, just tentatively apply, and if it doesn't work, try something else.
Rules that have been applied and didn't work may be revoked.
Chapter 3 - Solving Problems by Searching
What is an implicit graph? correct answers Begins with start node, build graph by choosing a
node and generating successors with a successor function.
The start node will be the initial state.
The successor function expands a node and applies applicable rules to state. The expanded node
is the parent and successors are children.
It is basically a tree.
Chapter 3 - Solving Problems by Searching
What are some irrevocable strategies? correct answers Flailing Wildly
Hill Climbing (And Variations)
