Last visit was: 01 Sep 2026, 14:45 It is currently 01 Sep 2026, 14:45
Home
Messages
Tests
Schools
Events
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
User avatar
mirhaque
User avatar
Joined: 02 Feb 2004
Last visit: 06 Aug 2008
Posts: 211
Own Kudos:
262
Posts: 211
Kudos: 262
ds: Chess 25 Mar 2005, 05:52
Kudos
Add Kudos
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

History

Date
Time
Result
Not Attempted Yet
tricky?



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
User avatar
kapslock
User avatar
Joined: 15 Mar 2005
Last visit: 19 Mar 2007
Posts: 202
Own Kudos:
71
Location: Phoenix
Posts: 202
Kudos: 71
ds: Chess 25 Mar 2005, 12:02
Kudos
Add Kudos
Bookmarks
Bookmark this Post
mirhaque
tricky?
Show more


I am not sure if an answer can be given to this problem because you can never determine the number of moves in a match. There are moved in which some of the pieces would be killed, but there are blank moves as well (in which no piece is killed, and in which the piece moved forward and then moves back). [Argument A].

However, if just going by the fact that the black pieces have moved 4 times less. Thus white pieces have not-lost 4 more matches than the black pieces. Thus black pieces might have won some number of matches (and from Argument A, we would never come to know of that number).

Please also note that a win (for black pieces) or a draw (for either black pieces or white pieces) can happen in an equal number of moves in 1 match.

Thus if both play 100 moves each, the black pieces have the last move, and they draw or win. White pieces dont win for sure in this case.

When white pieces draw or win, they would have played one extra move. So in case of black pieces not winning. Thus, the cases of white pieces win/draw is 5.

From this we can't make out how many of those cases were draw and how many were wins for white pieces.

Also, from Argument A, we can't figure out the number of matches - coz its different in each match, and there's no higher or lower limit on the number of moves per match.

Hence I'd assume this question cannot be answered.

Anyone with a greater insight into this one?



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderator:
Bunuel
Math Expert
113017 posts