Skip to content

The algorithm finds the match in which the strength of the two teams is closest

Notifications You must be signed in to change notification settings

emrecanstk/ideal-team-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 

Repository files navigation

Ideal Team Algorithm

It is a simple algorithm you can use for sport matches.

changes from previous version:
 1- player capacity: from 6 to infinity
 2- 20 lines less code
 3- 5 less definitions

future changes:
 1- uneven number of matches
 2- set score criteria

How does it work?

It chooses the most competitive of all team possibilities:

First we get the information of all the players. Then we find the match with the least difference between the two teams out of all team possibilities.

About

The algorithm finds the match in which the strength of the two teams is closest

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages