MathDB

In a round-robin tournament, where any two players play each other exactly once, the fact holds that among every three students

A

B

, and

C

, one of the students beats the other two. Given that there are six players in the tournament and Aidan beats Zach but loses to Andrew, find how many ways there are for the tournament to play out. Note: The order in which the matches take place does not matter.
Proposed by Kevin Zhao

Problem Statement