Is there an algorithm to solve my case?
<p>I’m facing a bit of a problem in one of my projects and I’m hoping you guys could bring some clarity to the matter. </p>

<p>The case is like this; I’ve got a group of 12 people divided into 4 groups. This is the initial line-up in a series of 3 rounds. </p>

<p>My problem I this; How can I re-render these groups, for the two following rounds, so that the people in the groups not before have met? </p>

<p>I want the re-rendered groups to be unique, eg. Person 1 shall never in the next two rounds join a group with either Person 2 or Person 3. And if Person 1 forms a group with Person 4 and Person 5 in the second round, these persons shall also be excluded in the last round. </p>

<p><strong>Group 1</strong></p>

<p>Person 1, Person 2, Person 3</p>

<p><strong>Group 2</strong></p>

<p>Person 4, Person 5, Person 6</p>

<p><strong>Group 3</strong></p>

<p>Person 7, Person 8, Person 9</p>

<p><strong>Group 4</strong></p>

<p>Person 10, Person 11, Person 12</p>
