We describe a semi-automated way to find nice links of two or more given 3D paths. These paths are typically generated in a particular lattice and are given a particular cross section. The goal is to find links where the paths are truly linked (entangled) and where they fit snugly together. A special use case is where the paths are all congruent. The search can be controlled by a number of parameters. We also show some links that were found this way.