A perfect match is a bijective mapping between 2xN points. Solving this matching is supported by two ways to gain information: a score signaling the overall number of correctly matched points (without revealing which are the correct pairs) and the possibility to directly investigate whether or not a single pairing is part of the perfect match.
This is a round based game, where both the total score as well as one pairing can be checked per iteration.
A questionable adaption of this problem with 2x10 participants is implemented in the RTL2 show "Are you the One", which is not necessarily endorsed by everyone.
Entries on the leaderboard are playing 1000 rounds with 10 pairings.
| Algorithm | Mean tries | Median tries | Min tries | Max tries | AUC-ROC |
|---|---|---|---|---|---|
| Bumblesort | 20.177 | 20 | 10 | 31 | 1.00 |
| TestRotate | 30.654 | 31 | 13 | 46 | 1.00 |
Complexity analysis (available by running the program with --complexity) is performed by solving the game for 2 to 2xN points, where N is defined by --matches.
Save complexity analysis results to .csv and combine all results to one big graph.