the most common formulation for actions uses a successor function. given a particular state x, successor-fn(x) returns a set of (action, successor) ordered pairs, where each action is one of the legal actions in state x and each successor is a state that can be reached from x by applying the action.
Discusssion
Login to discuss.