rmpl wrote:Genisaurus wrote:This is exactly why the general queuing system will never force groups of any size to only play against each other. We can have specific 6v6 scenarios that only allow 6-man groups to queue for them, that's fine and not abusable in any way i can see.
But general-queue SCs will only ever, at best, try to keep the number and size of groups even on either side. If a 6-man queues for a general-queue scenario, the matchmaking system can try to find another 6-man on the opposing team, and if it can't find one it can search for a 5-man, etc. We will not put premades in a separate queue altogether.
How long does it take for the matchmaking system to give up on 6-man team and start looking for 5-man/4-man etc?
Remember, this isn't a thing that's in place yet, I'm speaking purely in hypotheticals about improving the system that's there.
But to answer your question, we would need to ask, "What's the worst-case-scenario amount of time we want a group to have to wait for a queue?" Once we have that, we can work backwards.
The logic I'm imagine now would work like this:
Code: Select all
Repeat for numPartiesPerFaction times {
N = 0
x = 1;
1. Search (for (worst-case wait time / 5) seconds, or until one is found )for a (6-N) size group to put on Faction_A:Party[x].
If it cannot find one, increment N and repeat step 1.
If it finds one, reset N=0 and proceed to step 2
2. Search (for (worst-case wait time / 5) seconds, or until one is found) for a (6-N) size group for Faction_B:Party[x].
If it cannot find one, increment N and repeat step 2.
If it finds one, reset N=0 and proceed to step 3
3. increment x
}
/* Now each party has a group, of some size. Ideally a 6-man, but the largest one that could be found. Next we try to fill the gaps with smaller parties */
Repeat for numPartiesPerFaction times {
N = Faction_A:Party[x].size
x = 1
1. Search (for (worst-case wait time / 5) seconds, or until one is found) for a (6-N) size group to put on Faction_A:Party[x].
If it cannot find one, increment N and repeat step 1.
If it finds one, reset N=Faction_B:Party[x].size and proceed to step 2
2. Search (for (worst-case wait time / 5) seconds, or until one is found) for a (6-N) size group for Faction_B:Party[x].
If it cannot find one, increment N and repeat step 2.
If it finds one, proceed to step 3
3. increment x
}
/* Now each party has at least one group of the largest size available, and we've tried to fill any gaps in each party with a second, smaller group. This is all the groups we can reasonably fit. */
-- Search (for (worst-case wait time / 5) seconds, or until one is found) for solo-queued players to fill any remaining gaps here --
Nameless wrote:i just hope to not see EC at RoR! Ever!
Tough ****. If you don't like it, don't queue for it. I see no reason to omit
completely optional content just because it wasn't liked.
