Algorithm to solve the optimal stopping problem with finite horizon

We propose an algorithm that solves the optimal stopping problem with the finite horizon. The algorithm is based on a derived recurrent equation for the optimal stopping time. It fulfils "separation" principle of solving the optimal stopping problem. This algorithm, implemented in Maple 14 system of computer algebras, is used to solve optimal stopping problems for several discrete Markovian sequences.