Auto-sorting / auto-optimizing software based on number of groups

[kindai]

Hi guys,

Am looking for a bit of software or even an excel/google sheets type script that I can enter some simple yes/no based answers in for a bunch of people, then specify a number of groups and the software will automatically sort people into those groups based on trying to ensure the minimum number of overlaps between responces.

Any ideas?

Eg if one person answers yes for question one, it will try put them with someone who answered no

But across all questions, so to optimize it as best possible even though there isnt a "perfect" end solution.

 

[Temujin]

Sounds like an interesting problem, how big is the data-set?
It shouldn't be too difficult to write a Python script to do it, though I'd think there may be some cases where groups cannot be found based on the remainder of users left and their answers.

 

[kindai]

Sounds like an interesting problem, how big is the data-set?
It shouldn't be too difficult to write a Python script to do it, though I'd think there may be some cases where groups cannot be found based on the remainder of users left and their answers.

Each "batch"
12 people
10 questions
to ultimately be split into 3 different groups.


There would then be 8 more batches (which dont need to interact or be compared to the previous batches).

 

[Temujin]

Should be fairly simple to create a script to brute force it, I don't think time will become an issue given the small sample size.
Could make it simple where it randomly selects a person from a list, then looks at each of the other people until it finds a match of opposite question responses then pair them.
Or make it a little more complex by selecting a person, then iterate over the remainder and give them a weight as to how much they meet the criteria then pair them based on the weight.
Many more ways to approach it though!