There are $2n$ persons shaking hands in turns. In every turn every person shakes hands with exactly one other person. After the turn all of them may choose another partner.
I'm searching for:
- The minimal number of turns needed so that every person has shaken hands with all of the $2n-1$ other persons.
- An algorithm that calculates a minimal sequence of turns.