The quality (length) of solutions of problems of motion on graphs is addressed in this paper. Existing state-of-the-art algorithms for generating solutions of these problems are suspected of producing solutions containing redundancies of a priori unknown nature.
A visualization tool has been developed to discover such redundancies. Know-ledge about solutions acquired by the tool served as basis for the formal description of redundancies and for the development of methods how to detect and eliminate them.