Matching couples looks like an easy problem to solve, here, you have my little algo to find the optimum match for n couples: https://github.com/kfk/scripts/blob

Matching couples looks like an easy problem to solve, here, you have my little algo to find the optimum match for n couples: https://github.com/kfk/scripts/blob/master/match-date.py https://github.com/kfk/scripts/blob/master/match-date.py Ok, joking a bit, but there is a point to this. If you have a finite set of people (and I bet in a short time frame you can make that assumption), then in the WORST case you have to do n*(n+1)/2 matches. Let's say it takes 1 hr to run a date, then we can match 10 people in 55 hrs in the worst case. Now, try matching 10 people using these websites. Enter the texting game and no proper filtering (by looks, age, location, etc.). It will take X time my worst case scenario to maybe match half of the population. Point is: somebody should make a system that clusters people and randomly assigns them to dates. Without any prior texting that is. Which, by the way, would simulate the way people met until 20 years ago more or less.