Journal of Mathematical Psychology volume 49, issue 2, P155-159 2005 DOI: 10.1016/ View full text
Karl E. Scheibe, W.W. Comfort

Abstract: How can N individuals in a closed space meet and greet each other most efficiently? This paper presents a general solution to this problem-an algorithm or ''dance'' that will achieve universal pairing in the least possible number of moves or steps. A proof of the suggested algorithm is included, showing that it guarantees that every two participants will greet each other once and only once, and that no procedure with this property can be accomplished with fewer steps. Slightly different procedures are require…

expand abstract