"In this problem, competitors were given the description of two such networks, but with the names of all the nodes removed from each. The networks were each scrambled up before given to the competitors. The task was to determine if the two networks could possibly be from the same group of people.

"The competitors were to unscramble and label the two networks so that if Alice was connected to Bob in one of the two networks, then Alice was also connected to Bob in the other network. This problem is known as the network isomorphism problem, and solving it for large networks is a major unsolved problem in the realm of theoretical computer science."

Lydon said the overall problem is unsolved for larger networks, and what's considered a correct answer for this problem would not be considered large enough for the solution in this case to be groundbreaking.

Two people solved the problem.