Recall that a dictionary, also known as a hashmap, works as follows: Inserting a
ID: 3743787 • Letter: R
Question
Recall that a dictionary, also known as a hashmap, works as follows: Inserting a key-value pair into a dictionary when the key is not already in the dictionary adds the pair to the dictionary: dict an empty dictionary dict"ke""value" print dic"key"] "value" Updating the value associated with a dictionary entry is done as follows: dictkey"]"new value" print dict "key" "new value We saw that for A graph search to be guaranteed to be optimal the heuristic needs to be con sistent. In this question we explore a new search procedure using a dictionary for the closed setExplanation / Answer
Answer is as follows :
1 :
The correct option about A* graph search is , that if h is consistent then A* graph search finds a optimal solution i.e. a stronger condition than admissible solution. So correct option is A.
2: The correct option about A* graph search is , that if h is admissible then A* graph search finds a optimal solution i.e. a stronger condition than admissible solution. So correct option is B.
3: The true part about A*_CSCS is that if h is admissible, then A*_CSCS will exapand at most as many as nodes as A* Tree Search. So correct option is A.
4: The true part about A*_CSCS is that if h is consitent, then A*_CSCS will exapand at most as many as nodes as A* graph Search. So correct option is A.
if there is any query or missing part please ask in comments...
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.