- UID
- 579779
- 在线时间
- 小时
- 注册时间
- 2010-11-3
- 最后登录
- 1970-1-1
- 主题
- 帖子
- 性别
- 保密
|
各位网友:
承蒙各位关照,SDCAR2010【逻辑入门】取得了巨大成功。不才对【游戏】也有一定研究体会。现借CD宝地,和各位切磋。先从真题开始。如有人捧场,可能会写几篇解题要领,纲举目张,抛砖引玉。
祝大家心想事成,求学顺利。
SDCAR2010
64-1 有一个停车场需要给六个新人安排趴车位:Ron, Sue, Tom, Vincent, Xie and Ying。每人只能在以下趴车位趴车:#1, #2, #3, #4, #5, #6,而且每人的趴车位都不同。以下是分配条例: Ying 的车位号比 Tom 的大。 Xie 的车位号比 Sue 的大。 Ron 的车位号比 Ying 的大。 Ron 必须在 #1, #2, #3, 和 #4 之一趴车。
Analysis: For all games, after reading the stimulus, you have to quickly diagram the information into an easy-to-read and efficient form. Analyze every rule first. Then combine the rules to make necessary deductions. If you end up with only 2 possible options for a particular game, you should draw out those two options. If more than 2, it's better to leave the rules as they are, without wasting time to draw every single possibility.
For this question, it's rather simple. Six players, six positions, no overlap. This is the easiest type in LSAT. Make sure you can move quickly through this one and try to limit your time spent for the whole game within 5 minutes. Pay extreme attention to the floater (the player having ZERO constraint, for example, V, in this game), and the most restricted player (R in this case). The final diagram can be found in the following picture:
SDCAR2010【游戏入门】64-2 解析 |
本帖子中包含更多资源
您需要 登录 才可以下载或查看,没有帐号?立即注册
x
|