# Winning & Losing ## Winning The winner is selected via a randomised algorithm which is based off-chain and uses Chainlink’s Verifiable Random Function (VRF). However, one factor that increases the chance of winning is the number of games a Tree NFT plays. The more games a Tree NFT plays, the more valuable it becomes as it raises the chance of winning within the randomization framework. For example, Player B joined 40 total game matches and thus has a slightly higher chance of winning a match against Player A who has only joined 35 games. Chance of winning a game by percentages given that Player A has played the least games and Player D has played the most games: Player A -> 22% Player B -> 23% Player C -> 25% Player D -> 30% ### Losing In the 4 Player games everyone is a winner! Not only does the winner earn Avax but those who lose the race will also get back a percentage of their Avax as well. --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://plant-a-tree.gitbook.io/plant-a-tree-white-paper/trees-racing-game/winning-and-losing.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.