We formally define the perfect stranger matching problem (PSM) for experiments.
We propose a heuristic for maximizing the length of matching sequences.
Solution is provided in the form of matching tables, pseudo, and source code.
Run time comparisons with existing approaches are provided.
The solution contributes by tackling an increased problem size and number of matches.