In a tournament of Chess having 150 entrants, a player is eliminated whenever he loses a match. It is given that no match results in a tie/draw. How many matches are played in the entire tournament?

To solve this, we should avoid the robotic method of calculating round-by-round (e.g., 75 matches in round 1, then 37...). That path is slow and prone to error.\n\nInstead, apply the **Tournament Logic (Elimination)** [1][2] derived from PYQs:\n1. The goal of the tournament is to produce exactly **1 Winner** from **150 Entrants**.\n2. To have only 1 person remaining, **149 people must be eliminated**.\n3. The problem states that a player is eliminated exactly when they lose a match, and there are no draws. This establishes a **One-to-One Correspondence** [13][14]: **1 Match = 1 Loser**.\n4. Therefore, to eliminate 149 players, we need exactly 149 matches.\n\nThis logic turns a calculation problem into a simple logical deduction.