I'm working on a new concept for a tournament that awards the "Most Average" score.
It's called a "Bell Curve Tournament" since the winner is the "Most Mid".
In the end it will be used on anybody.gg (@triflelife) to run:ANYBODY BELL CURVE TOURNAMENT where ANYBODY CAN WIN

50 Reactions14 Replies & Quotes


I realized that I needed to keep the average speeds of all players sorted to find the most mid, which is a difficult problem in computationally constrained environments like the EVM. Luckily there's a type of self-balancing binary search tree (BST) called a Red-Black Tree πŸ”΄βš«οΈπŸŒ³

1 Reactions3 Replies & Quotes

ANYBODY CAN WIN. Genius.

I'm working on a new concept for a tournament that awards the "Most Average" score.
It's called a "Bell Curve Tournament" since the winner is the "Most Mid".
In the end it will be used on anybody.gg (@triflelife) to run:ANYBODY BELL CURVE TOURNAMENT where ANYBODY CAN WIN

50 Reactions0 Replies & Quotes

love it

0 Reactions0 Replies & Quotes

Let's try

0 Reactions0 Replies & Quotes

Hmm An interesting idea

0 Reactions0 Replies & Quotes

hmmm...

0 Reactions0 Replies & Quotes

cool

0 Reactions0 Replies & Quotes

gggg

0 Reactions0 Replies & Quotes

πŸ˜€πŸ˜€

0 Reactions0 Replies & Quotes

Yeah

0 Reactions0 Replies & Quotes