The optimal strategy for a class of non-Markov decision processes is characterised and has the property that changes of action may occur between successive transitions of the process. Results are given which enable the optimal strategy to be computed iteratively.