We study the enumeration of three friendly directed walks on the square lattice. We show how one can count different types of shared sites (interactions) by solving the associated functional equations using the obstinate kernel method. However, we also highlight that the introduction of finer counting problems that introduce asymmetry can lead to as yet unsolvable functional equations. We survey related results over the past few years counting extra features in multiple path problems.