Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
GmatStuck
Joined: 15 Sep 2021
Last visit: 03 Feb 2026
Posts: 59
Given Kudos: 15
Concentration: Finance
Schools: Columbia CBS '24 Haas '24 Wharton '24 Yale '24
Products:
03 Mar 2025, 13:56
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
85%
(hard)
Question Stats:
51% (02:35) correct
49%
(02:10)
wrong
based on 200
sessions
History
Date
Time
Result
Not Attempted Yet
One way to compare chess-playing programs is to compare how they perform with fixed time limits per move. Given any two computers with which a chess-playing program is compatible, and given fixed time limits per move, such a program will have a better chance of winning on the faster computer. This is simply because the program will be able to examine more possible moves in the time allotted per move.
Which one of the following is most strongly supported by the information above?
(A) If one chess-playing program can examine more possible moves than a different chess-playing program run on the same computer under the same time constraints per move, the former program will have a better chance of winning than the latter.
(B) How fast a given computer is has no effect on which chess-playing computer programs can run on that computer.
(C) In general, the more moves a given chess-playing program is able to examine under given time constraints per move, the better the chances that program will win.
(D) If two different chess-playing programs are running on two different computers under the same time constraints per move, the program running on the faster computer will be able to examine more possible moves in the time allotted.
(E) If a chess-playing program is run on two different computers and is allotted more time to examine possible moves when running on the slow computer than when running on the fast computer, it will have an equal chance of winning on either computer.
Which one of the following is most strongly supported by the information above?
(A) If one chess-playing program can examine more possible moves than a different chess-playing program run on the same computer under the same time constraints per move, the former program will have a better chance of winning than the latter.
(B) How fast a given computer is has no effect on which chess-playing computer programs can run on that computer.
(C) In general, the more moves a given chess-playing program is able to examine under given time constraints per move, the better the chances that program will win.
(D) If two different chess-playing programs are running on two different computers under the same time constraints per move, the program running on the faster computer will be able to examine more possible moves in the time allotted.
(E) If a chess-playing program is run on two different computers and is allotted more time to examine possible moves when running on the slow computer than when running on the fast computer, it will have an equal chance of winning on either computer.
07 Jun 2025, 03:33
Kudos
Bookmarks
Let's evaluate each option:
(A) If one chess-playing program can examine more possible moves than a different chess-playing program run on the same computer under the same time constraints per move, the former program will have a better chance of winning than the latter.
(B) How fast a given computer is has no effect on which chess-playing computer programs can run on that computer.
(C) In general, the more moves a given chess-playing program is able to examine under given time constraints per move, the better the chances that program will win.
(D) If two different chess-playing programs are running on two different computers under the same time constraints per move, the program running on the faster computer will be able to examine more possible moves in the time allotted.
(E) If a chess-playing program is run on two different computers and is allotted more time to examine possible moves when running on the slow computer than when running on the fast computer, it will have an equal chance of winning on either computer.
(A) If one chess-playing program can examine more possible moves than a different chess-playing program run on the same computer under the same time constraints per move, the former program will have a better chance of winning than the latter.
- This introduces a comparison between different programs, but the passage only talks about the same program running on different computers.
- This is not supported by the passage.
(B) How fast a given computer is has no effect on which chess-playing computer programs can run on that computer.
- This is not mentioned at all. The passage assumes compatibility but does not comment on what computers programs can or cannot run on.
- This is outside the scope of the argument.
(C) In general, the more moves a given chess-playing program is able to examine under given time constraints per move, the better the chances that program will win.
- This matches the core logic of the passage: more move analysis → better performance.
- The passage directly supports this: "the program will have a better chance of winning...because it can examine more possible moves."
(D) If two different chess-playing programs are running on two different computers under the same time constraints per move, the program running on the faster computer will be able to examine more possible moves in the time allotted.
- This introduces two different programs, which again is not part of the passage.
- The conclusion in the passage is about the same program running on different computers.
(E) If a chess-playing program is run on two different computers and is allotted more time to examine possible moves when running on the slow computer than when running on the fast computer, it will have an equal chance of winning on either computer.
- The passage never discusses adjusting the time limit based on computer speed.
- This introduces new assumptions and goes beyond what is supported.
GmatStuck
