Skip to content

Latest commit

 

History

History
22 lines (17 loc) · 516 Bytes

File metadata and controls

22 lines (17 loc) · 516 Bytes

Algorithms in Artificial Intelligence Course Study Materials

Main algorithms:

BackWardInduction:

* Z - all leaf nodes
* u - util function

function BackWardInduction (node h) returns u(h)
if h in Z:
	return u(h)
best_util = -inf
forall a in X(h):
	util_at_child = BackWardInduction(s(h,a))
	if util_at_child > best_util:
		best_util = util_at_child 
return best_util