Logic games are my strongest category of the LSAT, but I have recently had a few problems with the MLSAT technique. The Logic Games book endorses the Logic Chain as the most effective approach to tackling Close and Open Binary Games. However I am finding for the majority of these types of games that I am doing the Logic Chain is often more time consuming than it is beneficial.
The games I have done this past few days that MLSAT would categorize as Binary have been the following.
(PT.G#)
20.2, 24.4, 30.1, 31.2, 32.2, 33.2, 33.3, 35.1, 36.1
Able: 20.2, 33.2, 36.1
-These open/closed binary games and are great for the logic chain, not a better approach even though they have at least one constraint with difficult compound conditionals (ex. and in sufficient/ or in necessary).
Able but not most effective: 24.4, 33.3
-These are closed binary games that a chain can be used, but either the chain only is useful for less than half the elements or the chain can be deduced into simple shorthand ex. A --> B--> ~C and ~D
-Speed is sacrificed greatly in using the chain, due to larger amounts of variables than connections or inferences from them.
Non-existent: 31.2, 30.1, 32.2, 35.1
-These closed binary games where a chain is virtually non-existent, taking any time to attempt a chain is a hindrance.
I realize that these are only 9 games total and a relatively weak sample size, but I also wouldn't want to keep looking to use this approach if it is only effective for 1/3 of its game types.
I am just wondering if anyone has noticed this same trend with binary games, most specifically closed binary games?
Is it that i am incorrectly categorizing these games?
Or are these older "binary" games under-representative to the trends of the newer games labeled "binary", and if so does anyone know of a more accurate and recent list to work from?
Overall the Manhattan approach has been very effective for me, but these binary games are not holding well with the logic chain and endorsed approaches.