An efficient algorithm for computing the Euclidean free distance of TCM codes is described. The algorithm, based on the Viterbi algorithm, is taken in computing the Euclidean free distance of norm codes by assuming the all - zero information sequence to be a reference route. The Algorithm is applied to searching for good TCM codes on Gauss Channels.