A match making algorithm to create balanced teams from players with different skills.
Project description
A match making algorithm
The roach case is a match making algorithm to create balanced teams from players with different skills. It has two purposes:
Iteratively score player’s skill level based on the outcome of played matches.
Use the player’s latest scores to create balanced teams.
Scores are converted into roaches each players has in the roach case. Roaches are traded after each match, depending on the outcome.
It is inspired by the ELO scoring system used in chess and other games.
A Python package
This Python package contains the business logic of the match making algorithm, together with a very simple command line interface and simple persistence layers. Other components can use it and extend it with a different interface (web, standalone, …) and more scalable persistence (local or cloud database). Design is heavily inspired by Clean Architecture and/or Onion Architecture.
Documentation
Please read the latest documentation online
Credits
Stefano Berri
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for roachcase-0.3.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 58c0d472f5ed9f679aee5a435ff429667c9ca710c3228c05acd1a886080f8cc5 |
|
MD5 | c631ca2b540c31dba5665dcb99d04af1 |
|
BLAKE2b-256 | 30426f93592bba8e20f7d87e4d3d295769fd9fa95985ee8794015405951c775e |