Skip to content

Improving tilt calculation#1

Open
glee-b wants to merge 1 commit into
mzha:masterfrom
glee-b:tilting
Open

Improving tilt calculation#1
glee-b wants to merge 1 commit into
mzha:masterfrom
glee-b:tilting

Conversation

@glee-b
Copy link
Copy Markdown

@glee-b glee-b commented Oct 26, 2016

Thinking about converting win loss of past games to binary; 0 for wins, 1 for losses

Example:
We play 3 games, with the result
Game 1: Loss --> 1
Game 2: Loss --> 1
Game 3: Victory --> 0

Converting to binary, we get: 011
The binary value then gets converted back to a percentile, then to decimal.

This way, the more recent games are weighted even more than they are currently. The player is more likely to be tilted from the most recent game, than the game from two games ago.

Also changed to use python's built-in round function instead of a non-native implementation.

@mabotkin
Copy link
Copy Markdown
Contributor

Could also consider a sigmoid function or logistic curve which both are functions of an exponential and so will increase faster as the number of consecutive losses increases - just an idea.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants