I would like to use the occasion that prof. Cormac become involved
in this discussion to say THANK YOU to the Waterloo team for the excellent
problems they offered us during the last decade. I learnt a lot from
these problems.
I am extremely curious about the logic behind the author's solution of
this particular problem. Correct me if I am wrong, but it seems that
the problem is not about finding the "optimal" pairing in the first round
of the tournament, but rather to find the "lucky" knights who are not going
to take part in it (in other words - this is not the same problem as finding
the "optimal" pairing itself)?
By the the way, I recently came across a curious quote:
"...realize should you Luke that two ways are there to solve a problem - DP and
greedy called are they. Implies the first - the Force use you. Implies the second -
closer to the Dark Side are you, in danger you are..."
Yoda
![:)](./images/smilies/icon_smile.gif)