2023 tennis draw challenge season

Hello,

Welcome to this seventh tennis post. For better visibility, I advise you to look at my posts on a computer (for the size but also because the colors differ on a phone that has a dark theme like me. If the theme is light, only the size makes it difficult to read).

Today a dynamic visualization on a free tennis betting game. The game in question is called TennisDrawChallenge and the principle is as follows : before each tournament starts, the player must fill out the draw and therefore put a winner in each match until the final.

The further we advance in the draw, the more a good result found (i.e. the correct winner of the match) gives a significant number of points. In the end, it is not necessarily the one who found the most good match winners who wins the most points, it is sometimes better to find the good winners of the last matches of the tournament ! But the game is a marathon (around 65 tournaments by year), so you have to be regular.

In the dynamic dataviz below, the progression in terms of points for 4 players. The 4 players are number 1 in the final ranking (gray colors), me (yellow color), and my 2 friends (blue and red colors). Participants in places 2, 3 and 4 have next to their bar, the number of points behind 1st position.

After several changes between the last 3 places, I take 2nd place regularly around tournament 40, but the gap on 1st place is too big and will continue to grow until the end. For the record, I finished 50th in the final general ranking (with a success percentage of 54.2%). Vauv30 finished 76th with 53.3% and Romybalt 96th with 53.7%. Gimpel finished with 57.7%.

Below is a static version of the dataviz, where we can perhaps better see to what extent gimpel is eating away at acance little by little.

This year I am therefore aiming for a better result, I would say the top 30 overall. But it got off to a bad start, I forgot to participate in a tournament (around 30 points less), which could ultimately be a handicap... !

Thanks for reading ! I hope it was clear and you liked it.

You will find the code below by clicking the github link button

If you have any questions or remarks, I invite you to create an account (it's free) to write a comment, or simply to be notified of a new post in the future !

See you soon for new content 👋