Session 3 Flashcards
(50 cards)
What is the definition of a search strategy?
A search strategy is a method used by problem-solving agents to explore the state space and find a solution to a given problem.
What is the purpose of a search strategy?
The purpose of a search strategy is to systematically traverse the state space to reach the goal state from the initial state.
What are the two main types of search strategies?
The two main types of search strategies are uninformed search and informed search.
What is an uninformed search strategy?
An uninformed search strategy is a method that does not use additional information about the goal state beyond the problem definition.
What is an informed search strategy?
An informed search strategy is a method that uses heuristic information to estimate the cost of reaching the goal state.
What is Breadth-First Search (BFS)?
BFS is an uninformed search strategy that explores all nodes at the current depth before moving to the next depth.
What is Depth-First Search (DFS)?
DFS is an uninformed search strategy that explores as far as possible along a branch before backtracking.
What is Uniform Cost Search (UCS)?
UCS is an uninformed search strategy that expands the node with the lowest path cost.
What is Iterative Deepening Search (IDS)?
IDS is an uninformed search strategy that combines the space efficiency of DFS with the completeness of BFS by performing DFS with increasing depth limits.
What is a heuristic function?
A heuristic function is an estimate of the cost to reach the goal from a given state.
What is the key advantage of A* search?
A* search guarantees the optimal solution if the heuristic is admissible (never overestimates the cost).
What is the main limitation of DFS?
DFS is not guaranteed to find the optimal solution and can get stuck in infinite branches.
What is the main advantage of BFS?
BFS is complete and optimal for unweighted graphs.
What is the main limitation of UCS?
UCS can be slow if many nodes have similar costs.
What is the main advantage of IDS?
IDS is complete and uses less memory than BFS.
What is the main limitation of Greedy Best-First Search?
Greedy Best-First Search does not guarantee the optimal solution.
What is the purpose of a state space representation?
State space representation is used to model all possible states and transitions in a problem.
What is a search tree?
A search tree is a tree representation of the state space where nodes represent states and edges represent actions.
What is the role of feedback in learning agents?
Feedback helps learning agents improve their performance by evaluating actions and guiding the learning process.
What are the four components of a learning agent?
The four components of a learning agent are the performance element, learning element, critic, and problem generator.
What is supervised learning?
Supervised learning is a method where the agent learns from labeled data with known outcomes.
What is unsupervised learning?
Unsupervised learning is a method where the agent learns patterns and structures from unlabeled data.
What is reinforcement learning?
Reinforcement learning is a method where the agent learns by interacting with the environment and receiving rewards or penalties.
What is the role of the critic in a learning agent?
The critic evaluates the agent’s actions and provides feedback to guide learning.