In chess tournament, there are 14539 contestants. Acording to the rules of tournament, each player that wins a game, goes to the next round and the one who loses the game, is eliminated. In case of a draw, the coin is tossed and one of them is eliminated and one goes to the next round. How many games must be played, in order to find the best chess player in this tournament?

Question

lgbasallote · Answer

considering there will be no draw it would be just keep on dividing by 2..because there are 2 players each game

lgbasallote · Answer

oh wait...even if draw...

mathmagician · Answer

so the answer is

anonymous · Answer

yeah thats the idea

unklerhaukus · Answer

before found one there are        $14539$
after round one ther are          $\frac{14539}{2}$
after round 2 there are         $\frac12 \frac{14539}{2}$

anonymous · Answer

trying to set up a relation

lgbasallote · Answer

divide by 2...the quotient (remainder excluded) is the number of games

unklerhaukus · Answer

is the player who wins the torment necessarily    the best player?
what if the last game was a draw and the winner was decided by a coin flip ?

mathmagician · Answer

the winner will be the one, who will win a toss of coin

lgbasallote · Answer

luck is essential too

anonymous · Answer

fyi the grandmaster of chess for 7 straight years is none other than Vishwanath Anand

mathmagician · Answer

so, anyone will say, how many games will be played?

anonymous · Answer

bobby fischer was definetly among the great, chess was dominated by the Russians and after the cold war, bobby was the first American to win. I imagine he was hugely publicised in the states. Yeah sadly hes delusional now :(. But no one was grandmaster of chess and defended the top title for 7 years in a row other than Anand