
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

IIT GATE Exam 2024 : CS - Computer Science and Information Technology : Code

5 pages, 76 questions, 6 questions with responses, 19 total responses,

	Harshitha P	+Fave Message
	Profile Timeline Uploads

Home > harshitha2324 >

Formatting page ...

MODULE 2: SOLVING PROBLEMS BYSEARCHING SUMMARY Informed search methods may have access to a heuristic function h(n) that estimates the cost of a solution from n. o The generic best-first search algorithm selects a node for expansion according to an evaluation function. o Greedy best-first search expands nodes with minimal h(n). It is not optimal but is often efficient. o A*search expands nodes with minimal f(n) = g(n) + h(n). A is complete and optimal, provided that h(n) is admissible (for TREE-SEARCH) or consistent (for GRAPHSEARCH). The space complexity of A* is still prohibitive. The performance of heuristic search algorithms depends on the quality of the heuristic function. One can sometimes construct good heuristics by relaxing the problem definition, by storing precomputed solution costs for subproblems in a pattern database, or by learning from experience with the problem class QUESTIONS Practice questions: 1. 2. 3. 4. 5. Explain Greedy best first search with respect to informed search strategies Explain A*search with respect to informed search strategies With respect to A* search discuss conditions for optimality What do you mean by optimality of A*? Discuss the heuristics for 8 puzzle example

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)

springy
(2)

aryan
(2)

lilybud
(2)

siaclone
(2)

Formatting page ...

harshitha2324 chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: