Re: [math-fun] optimal advance tournament scheduling

If for example A beats B and B beats C, then we can at least guess that A can beat C. So, even if A doesn't play C in this case, there seems to be at least some information about A vs. C. —Dan Michael Collins wrote: ----- Some quick observations: given two players who are adjacent in the ordering, we cannot tell who is stronger if they do not actually play one another; this means that a tournament schedule without a Hamiltonian path can never give enough information to reconstruct the entire ordering. It also means that an incomplete tournament schedule can never guarantee reconstruction of the full ordering. ... -----