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 algorith works pretty efficient with 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 too slow.
I am looking for an algorithm capable programmer to optimize this algorithm, to make it production ready.
9 freelancers are bidding on average €75 for this job
reason for pricing is one and only that we put maximum efforts in one assignment we are working only in one assignment and project at one [login to view URL] working mission is only client satisfaction.