LSAT 147 – Section 4 – Question 25

LSAT 147 - Section 4 - Question 25

September 2016

You need a full course to see this video. Enroll now and get started in less than a minute.

Request new explanation

Target time: 2:14

This is question data from the 7Sage LSAT Scorer. You can score your LSATs, track your results, and analyze your performance with pretty charts and vital statistics - all with a Free Account ← sign up in less than 10 seconds

Question
QuickView		 Type Tags Answer
Choices		 Curve Question
Difficulty		 Psg/Game/S
Difficulty		 Explanation
PT147 S4 Q25
+LR
Most strongly supported +MSS
A
21%
164
B
1%
154
C
55%
165
D
20%
160
E
3%
161
141
160
180
 +Hardest 146.282 +SubsectionMedium

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.

Summary
One way to compare chess-playing programs is to compare how they perform a fixed time limit per move. This comparison is done by using any two computers that can run the program and giving each computer a set time limit to make a move. The faster computer will have a better chance of winning because the program can examine more moves within the same span of time and pick the best possible move.

Strongly Supported Conclusions
If two computers are running the same chess-playing software, the computer that can analyze the most available moves within a given time limit is most likely to win.

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 sounds similar but presents a very different situation. This talks about two *different* programs running on the *same* computer. If there were two different programs, there would be many more confounding variables to make a comparison.
B
How fast a given computer is has no effect on which chess-playing computer programs can run on that computer.
The stimulus says that the speed of a computer dictates how many moves the computer can assess, but nothing says its speed has no bearing on what program it can run. For example, you probably couldn’t run a fancy program on a potato 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.
This captures exactly what the stimulus details. The faster computer can examine more moves and is thus better positioned to make better moves and 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.
This is a very different scenario than the stimulus. This answer choice has two different computers and two different programs. You can only reach the same conclusion under the same conditions presented in the stimulus.
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.
There is no information on what would happen if a slower computer was given more time compared to a faster computer. You have to assume that the processing speed of the slower computer is exactly equal to the time difference given to the faster computer.

Take PrepTest

Review Results

LSAT PrepTest 147 Explanations

Section 1 - Logical Reasoning

Section 2 - Reading Comprehension

Section 3 - Reading Comprehension

Section 4 - Logical Reasoning

Get full LSAT course

Leave a Reply