Informed Search and CSP

Define heuristic function in the context of informed search.

• Function to compute exact path

• Function that estimates cost to reach goal

• Random function for learning

• Function for rule-based inference

Identify the search algorithm that uses both path cost and heuristic value.

• DFS

• BFS

• A*

• Dijkstra

Choose the main advantage of informed search over uninformed search.

• Uses random paths

• Explores all nodes

• Avoids loops

• Uses problem-specific knowledge

Identify the term for the estimated cost from the current node to the goal in informed search.

• Heuristic value

• Cost function

• Path length

• Distance metric

Identify the issue with Greedy Best First Search.

• Slow performance

• Ignores heuristic

• May not be optimal

• Explores all nodes

Identify the component that describes legal values for a variable in CSP.

• Domain

• Constraint

• Graph

• Goal state

Choose which problem is not a typical example of CSP.

• Cryptarithmetic

• Sudoku

• Map Coloring

• Path Planning

Identify the most common solving method for CSPs.

• Gradient Descent

• Backtracking Search

• Hill Climbing

• Greedy Search

Label the three components of a CSP.

• Variables, Goals, Operators

• States, Heuristics, Nodes

• Variables, Domains, Constraints

• Inputs, Outputs, Functions

Select the main reason for using CSP in AI.

• Solves random problems

• Models problems with constraints

• Reduces execution time

• Trains neural networks