1. Joined
    27 Jul '09
    Moves
    33791
    10 Jun '14 11:18
    Hi, I am in the "2014 January Mini Duel II 1750-1800" tournament and would like to see if a feature request could be implemented.

    I understand that player distribution is automated when a new round starts, and there are a lot of tournaments!

    However it is possible, as in the tournament above, that a player could be paired with an inactive user, and 3 active players could be grouped together.

    It would make more sense if the inactive player could be added to a pair instead of a single player, effectively leaving 2 active pairs

    To achieve this, either the administrator would need to approve each new round and move players accordingly, or code would need be written to add the least active player to the group with the most players

    Not a major thing but it would make the rounds fairer
    thanks
  2. SubscriberPonderable
    chemist
    Linkenheim
    Joined
    22 Apr '05
    Moves
    655386
    10 Jun '14 11:321 edit
    Originally posted by shaptoni
    Hi, I am in the "2014 January Mini Duel II 1750-1800" tournament and would like to see if a feature request could be implemented.

    I understand that player distribution is automated when a new round starts, and there are a lot of tournaments!

    However it is possible, as in the tournament above, that a player could be paired with an inactive user, and 3 ...[text shortened]... the group with the most players

    Not a major thing but it would make the rounds fairer
    thanks
    This belongs to Site Ideas

    Suggest a good algorithm for that...I don't think it is feasible.

    The tournament in question si Tournament 18902 and it has to be said, the OP is facing the inactive player.

    Send him a reminder and see if he resurfaces.
  3. Joined
    27 Jul '09
    Moves
    33791
    10 Jun '14 13:14
    Thanks - I have reposted in the correct area

    *** this post is now closed ***

Cookies help us deliver our Services. By using our Services or clicking I agree, you agree to our use of cookies. Learn More.I Agree