QUESTION TYPE: Most Strongly Supported
- If two computers use the same chess program and have a fixed time limit per move, the faster computer has a better chance of winning.
- This is because the faster computer can calculate more moves within the time limit.
ANALYSIS: You have to be careful with this. The author is not saying that speed always wins. They’re saying that when other things are equal, speed helps to win.
Remember, the two computers are using the same chess program. It’s possible that a different program would be worse, even if it was on an infinitely fast computer. For example, I could write a chess program where my King charges solo towards the other side every time. That program would lose every game, no matter how fast the computer was.
- This says “different chess playing program”, so it’s wrong. The stimulus talked about the same chess playing program. A chess playing program might be able to examine many moves and yet have a bad strategy.
- The argument never said what makes a computer compatible with a chess playing program. Maybe speed is a factor. Some computers are too slow to run some software.
- CORRECT. This is supported by the argument. In the experiment, the researchers held every factor equal except the number of moves analyzed per turn. And they said more moves analyzed per turn improved the odds of victory.
- Same as A. The stimulus was talking about two computers running the same program. This talks about different programs.
A certain program might be really inefficient and therefore slow at analyzing moves, even on a fast computer.
- This does say the same program, which is good. But, it doesn’t say how much more time the computer has. If it gets 10% more time, but the other computer is 200% faster, then the faster computer will still analyze more moves and have higher odds of victory.