Here's the idea: given a randomly generated partial order, turn it into a total order using as few pairwise comparisons as possible.

To make a comparison, select two nodes and the partial order will update itself based on which node is larger.

Think of it like "sorting" when you don’t know all the relationships yet.

Note that the distinct numbers being sorted would be hidden. That is, all the nodes in the partial order would look the same.

Would this sorting game be fun, challenging, and/or educational?