I have an algorithm for Tournament Matchmaking.
- Always an even number of teams
- Always less disciplines than teams present
- All teams must participate in each discipline ONCE and only once
- Every team must only participate against another team ONCE in the whole tournament:
That means with four teams:
And three disciplines
The Macthmaking would be:
1 vs 2
3 vs 4
2 vs 3
4 vs 1
1 vs 3
2 vs 4
The recursive pathfinder algorithm SOLVES this, but is very Big O sensible, so it is not efficient enough.
I posted the current implementation of this algorith. Gets the work done, but with more than 18 teams and 8 disciplines it gets WAY too slow for practical implementation.
I am looking for an algorithm capable programmer to optimize this algorithm, to make it production ready.
12 pekerja bebas membida secara purata €170 untuk pekerjaan ini
Hi! I'm interesting your project very well. I am mastering java and kotlin, algorithm. And also I have many experience and good skill about web development. Let's go ahead with me