Reputation: 35
Is there an efficient algorithm for maching unique individuals so that no group of them have ever seen each other?
I am currently looking to implement an algorithm, that matches a given set of individuals, and produces groups of three individuals who have all never seen each other. So far I have been trying to achieve this by creating an array and assigning each individual a prime number (the id), which gets multiplied with another individuals id to create a key upon matching. This will then be used in successive matches to eliminate the possibility of matching again. So far the groups have been formed by simply taking a list of individuals, starting from the first and then matching that indiviual with the first individuals in the list, whose id does not divide the key, and then removes that group. However this has sometimes led to groups of people being left over, so i wanted to ask whether there is an existing algorithm for this problem already?
Upvotes: 1
Views: 150
Answers (0)
Related Questions
- Splitting people into two teams having the graph of relationships
- I need a team-building algorithm that takes restrictions into account
- Grouping of people multiple times, where all the members meet each other in the same group at least once
- Divide people into two teams and don't assign same team who hate each other
- Creating non reoccuring random groups of people
- Splitting into teams algorithm
- Divide a group of people into teams with constraints
- Assigning n players to 3-member teams to reduce number of repeated games?
- Matching people with people they don't already know
- Algorithm for dividing people into 1-to-1 or 2-to-2 teams