Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Suppose we have two admissible heuristics h 1 ( n ) and h 2 ( n ) ( where n is a node ) ,

Suppose we have two admissible heuristics h1(n) and h2(n)(where n is a node), which of the following is true
min(h1(n),h2(n)) is a better heuristic than h1(n) or h2(n)
max(h1(n),h2(n)) is a better heuristic than h1(n) or h2(n)
h1(n)-h2(n) is a better heuristic than h1(n) or h2(n)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Design Using Entity Relationship Diagrams

Authors: Sikha Saha Bagui, Richard Walsh Earp

3rd Edition

103201718X, 978-1032017181

More Books

Students also viewed these Databases questions

Question

If a, b, c, d R, prove that the inverse of the 2 2 matrix

Answered: 1 week ago

Question

What is the most important part of any HCM Project Map and why?

Answered: 1 week ago