The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. In this talk, I will report on an algorithm that builds a descending chain of overgroups to determine the normaliser. The performance is compared with other implementations. We end with an inspection of several interesting examples.