For EACH of the following search methods below, answer both of the following questions two questions:
S / \ h=20 A B1 h=10 | | h=0 G B2 h=10 | B3 h=10 ...(infinite branch)then Greedy Search will follow the infinite branch and can not find the solution. Greedy search is not guaranteed to output the optimal solution. Consider the following case, Greedy Search will follow path S->B0->B1->G, which is not an optimal path.
Let us consider the problem of search in a three-player game. You can assume that no alliances are allowed. We will call the players A, B, and C for convenience. The first change is that the evaluation function will return a list of three values indicating (say) the likelihood of winning for players A, B, and C, respectively.
Complete the following game tree by filling out the backed-up value triples (i.e. find correct values for the "??") for all remaining nodes, including the root:
to move A (?? ?? ??) / \ / \ B (?? ?? ??) (?? ?? ??) / \ / \ / \ / \ C (?? ?? ??) (?? ?? ??) (?? ?? ??) (?? ?? ??) / \ / \ / \ / \ / \ / \ / \ / \ A (+1 +2 +3) (+4 +2 +1) (+6 +1 +2) (+7 +4 -1) (+5 -1 -1) (-1 +5 +2) (+7 +7 -1) (+5 +4 +5)
to move A (+1 +2 +3) / \ / \ B (+1 +2 +3) (-1 +5 +2) / \ / \ / \ / \ C (+1 +2 +3) (+6 +1 +2) (-1 +5 +2) (+5 +4 +5) / \ / \ / \ / \ / \ / \ / \ / \ A (+1 +2 +3) (+4 +2 +1) (+6 +1 +2) (+7 +4 -1) (+5 -1 -1) (-1 +5 +2) (+7 +7 -1) (+5 +4 +5)
H2: Serve Chateau Earl of Bartonville Red? (using
entree is steak
H3: Serve Toe Lakes Rose?
entree is unknow
H4: Serve Honest Henry's Apple Wine?
guest is not well liked
entree is chicken
cheap wine is indicated
| (using B10)
wine is indicated
| (using B11)
guest is sophisticated
Honest Henry's Apple Wine is chosen!
Yes, it could. For example, with facts:
Guest is sophisticated.
Guest should be impressed.
Entree is Mexican.
Entree is Steak.
You will choose Chateau Earl of Bartonville Red.
No. Because to choose carrot juice, you need to have at least two facts:
Guest is a health nut.
Carrots are not to be served.
But with the first fact, you could also choose Glop, which is prior to carrots juice in the hypotheses list. Since you will check the hypotheses in the order they appear in the list, Glop will be checked first, and will be chosen. So carrot juice will never be chosen.
Constructing the fish-hook pairs for topological sorting procedure we
get the following table.
Using this list we can build the class precedence list as follows
Teachers - Procedure to be stored here
Hackers - Procedure to be stored here
As is obvious from the class precedence list we can now say that Crazys income slot will be filled from the Teacher's Income slot. Hence his income will be Low.
We can use the same precedence-list as above to answer this question. Obviously since Eccentric is closer to Crazy than Teachers and Hackers on the class precedence list, the income slot of Crazy wil be fille using the income slot of Eccentric. Hence in this case his income will be Erratic
Considering only the relevant portion of the figure (E9.1 - Pg 647)
we get the following fish-hook pairs to determine class precedence
Using this table we can construct the class-precedence list for John as follows.
Class precedence list:
A more detailed explanation to be posted soon.