Hello, Could you please explain that what is terminal and non terminal node of AO* search algorithm with these example that you has discussed? Thanks in Advance
In the second example you calculated "and" values for both subtrees. Is it possible to have "or" values in the subtrees? For example in node "c" we take the lower value which is 4.