Determine whether goal- or data-driven or bi-directional search would be prefera

Question

Determine whether goal- or data-driven or bi-directional search would be preferable for solving each of the following problems. Justify your answer. a) You have met a person who claims to be your distant cousin, with a common ancestor named Tim Brown. You would like to verify her claim. b) Another person claims to be your distant cousin. He does not know the common ancestor's name but knows that it was no more than ten generations back. You would like to either find this ancestor or determine that the person did not exist c) A theorem prover for plane geometry. d) Classify trees by their characteristics.

Explanation / Answer

Answer:

a) You have met a being who claims to be your far-away cousin, with a common ancester name “John Doe”. Verify the maintain. Use a mixture of methods - “many frontier search”:

(1) expand several generation of John Doe’s descendents.

(2) build up several generation of your ancesters and

(3) of the theoretical cousin’s ancesters. Look for normal vertices in these chart.

b) Another being claims to be your distant cousin.

He do not know the ancester’s name, but know that it was more than eight generation back.

You would in the vein of to find this ancester or conclude she does not exist. Goal-driven, twice: extend ancester foliage for both you with the “cousin”, look for people general to these.

c) A theorem prover in favor of plane geometry. Theorem provers are almost always goal-driven.

Data-driven amounts to ask “What are all the theorems I be able to prove in this organization?” Aside from the obvious TMI, there would be a lot of insignificantly almost-redundant theorems.

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.