Challenge #247: Pairing Partners

[JasonHu]

Here is my submission, solve it with an iterative macro.

Spoiler

[danilang]

Fun one

Non-macro implementation of Schurig's table method.  Works for even and odd numbers of competitors.  For odd number of competitors consider pairing 1 of every week to be a by.

Spoiler

Dan

[Luke_C]

Spoiler

[Sebastiaandb]

**bleep**, this was a hard one for me!

Spoiler

Thank god for iterative macro's 

[estherb47]

Found this site helpful as well. https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/what-is-modular-...

Went a non-macro route that works with any even number of participants

[Watermark]

Spoiler

 

Spoiler

 

[LiuZhang]

Spoiler

Macro 1 - create pairingMacro 2 - Update Meeting Count and generate weekly pairingMacro 2 - Generate weekly pairingResultWorkflow

Went for the idea of creating a Meeting Counter, so each time a pair met, the counter goes up by one. Every week planning for meeting, we start with the pairing with lowest counter (i.e. met least amount of time).

N.B. due to the initial alphabetical sorting of name, the bottom pair was forced to meet until the top combination run out, (some random sorting could solve this issue). Though in the long run, it should even out.

[Shifty]

Several attempts later...

Spoiler

🤔

[SylwiaDragon]

Done

[scoles0617]

My solution: