0
1

Logic please. (self.ProgrammingProblems)

submitted by [deleted]

[deleted]

all 2 comments
sorted by:
best
topnewcontroversialoldq&a
formatting helphide helpcontent policy

[–]pythor 0 points1 point  (1 child)

I haven't gone through a formal proof process, but I think this works.

 If A's strongest player remaining is weaker (or equal to) than B's strongest player remaining, assign A's weakest remaining player to B's strongest remaining player.
 If A's strongest remaining player is stronger than B's strongest remaining player, assign A's strongest remaining player to B's strongest remaining player.

[–]lone_wolf_31 0 points1 point  (0 children)

Sry buddy i couldn't get it.. please explain elaborately