Description: First define to allow the state S = ((x, y) | x = 0 or 3, y = 0,1,2,3 x = y = 1,2), to allow the decision-making D = ((u, v) | u+ v = 1,2), seek dk < -D (k = 0,1,2, ..., n), so that state Sk < -S state transition in accordance with law S (k+1) = S (k )+ (-1) ^ k* dk, from the initial state S1 = [3,3] by the finite-step to reach the status S (n+1) = [0,0]. This is a multi-step decision-making problem solving
To Search:
File list (Check if you may need any files):
anquanguohe.m
Download