Draw the complete state space search graph for the farm
Need help with this assignment?Get an original answer from a qualified tutor — from $10/page.
Get it written →
1. Draw the complete state space search graph for the farmer, wolf, goat, and cabbage problem. Indicate the paths that are discarded due to constraint violations or duplicate nodes.
2. Determine whether goal-driven or data-driven search would be preferable for each of the following problems. Justify your answer.
a. Diagnosing mechanical problems in an automobile.
b. You have met a person who claims to be your distant cousin, with a common ancestor John Doe. You would like to verify her claim.
c. 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 eight generations back. You would like to either find this ancestor or determine that she does not exist.
d. A theorem prover for plane geometry.
e. A program for examining sonar readings and interpreting them, such as telling a large submarine from a small submarine from a whale from a school of fish.
f. An expert system that will help a human classify plants by species, genus, etc.
3. a. A search procedure finds a solution at level 10 with a penetrance of 0.005. What is the effective branching factor and approximate number of nodes that are examined?
b. An alternative search procedure has an effective branching factor of 1.4. What is the penetrance and number of nodes examined using the alternative?
4. a. Use the alpha-beta search algorithm to determine the best move and the expected gain (or loss) for the each of the game trees shown in Figure A on the next page. Assume that the tree is searched from left to right. Indicate the branches which are pruned by the alpha-beta process.
b. Repeat step a using Figure B.
c. Repeat step b (Figure B) searching the tree from right to left. Explain the differences in your results.
1. Draw the complete state space search graph for the farmer, wolf, goat, and cabbage problem. Indicate the paths that are discarded due to constraint violations or duplicate nodes.
2. Determine whether goal-driven or data-driven search would be preferable for each of the following problems. Justify your answer.
a. Diagnosing mechanical problems in an automobile.
b. You have met a person who claims to be your distant cousin, with a common ancestor John Doe. You would like to verify her claim.
c. 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 eight generations back. You would like to either find this ancestor or determine that she does not exist.
d. A theorem prover for plane geometry.
e. A program for examining sonar readings and interpreting them, such as telling a large submarine from a small submarine from a whale from a school of fish.
f. An expert system that will help a human classify plants by species, genus, etc.
3. a. A search procedure finds a solution at level 10 with a penetrance of 0.005. What is the effective branching factor and approximate number of nodes that are examined?
b. An alternative search procedure has an effective branching factor of 1.4. What is the penetrance and number of nodes examined using the alternative?
4. a. Use the alpha-beta search algorithm to determine the best move and the expected gain (or loss) for the each of the game trees shown in Figure A on the next page. Assume that the tree is searched from left to right. Indicate the branches which are pruned by the alpha-beta process.
b. Repeat step a using Figure B.
c. Repeat step b (Figure B) searching the tree from right to left. Explain the differences in your results.
Requirements for assignments:
· Write legibly. If I cannot read your writing, it will be marked as incorrect.
Options for submission:
· Use a diagramming program and type your answers in Word.
· Write on paper and take photos using your camera or scanner. Images can be inserted into a Word document or submitted as jpg/png’s in a zip file.
4�
9�
2�
8�
0�
12�
4�
18�
2�
4�
8�
5�
10�
4�
8�
12�
Max�
Max�
Min�
Min�
Figure B Depth-4 Game Tree�
8
7
2
1
4
2
6
1
9
1
3
5
2
5
6
2
9
3
1
2
3
4
6
9
2
7
9
Max
Min
Max
Figure A
Depth-3 Game Tree
8�
7�
1�
2�
1�
4�
2�
6�
1�
9�
1�
3�
2�
5�
2�
5�
6�
2�
9�
3�
3�
4�
6�
9�
2�
7�
9�
Max�
Min�
Max�
Figure A Depth-3 Game Tree�
4
9
2
8
0
12
4
18
2
4
8
5
10
4
8
12
Max
Max
Min
Min
Figure B
Depth-4 Game Tree
Get a plagiarism-free answer to this question
Send us your instructions and we’ll match you with the best writer in your subject.
- 100% human-written, zero AI
- Turnitin report included
- Confidential — we never share your data
- Free revisions & refunds