[Page 1 of 26] Welcome To Kaplan's Grouping Games Of Selection Workshop This is one in a series of orkshops focusing on the !

ifferent t"pes of logic games that appear regularl" on the #S$T% &n this orkshop e ill'

intro!uce "ou to Grouping games( sho "ou ho to recogni)e Grouping games of Selection( recommen! *aster Sketch an! scratch ork strategies( make "ou a are of the t o a"s in hich the #S$T a!!s a t ist to the stan!ar! Grouping game of selection( an! e+amine ,uestions most commonl" associate! ith this game t"pe%

-ou shoul! alrea!" .e thoroughl" familiar ith the Kaplan /0Step *etho! for #ogic Games 1 e're going to !i2e right in an! use it% -ou are .oun! to see at least one Grouping game on Test 3a" 1 so let's learn a.out ho the" ork% Grouping Games -ou shoul! start all logic games the same a"' ." emplo"ing Step 1 of the Kaplan *etho!% What is the Situation in the game4 Who are the Entities4 What is the Action of the game4 What are the Limitations of the game4 Of the four5 i!entif"ing the Action is most important% -ou kno that the game is a grouping game hen the action to .e un!ertaken is to assem.le the entities into groups% $s it turns out5 there are t o t"pes of grouping games presente! on the #S$T' 1% Games that pro2i!e a pool of entities an! ask "ou to select a group from that pool are calle! Grouping games of Selection( these games are the focus of this orkshop% 2% Games that ask "ou to !i2i!e a group of entities into su.groups are calle! Grouping games of Distribution( these are co2ere! in the 6Grouping Games of 3istri.ution6 orkshop% The character of .oth t"pes of grouping games !epen!s hea2il" on the num.ers of entities in the groups% This is a crucial point5 orth making into a har! an! fast rule' When !ealing ith grouping games5 al a"s keep close track of the num.ers7

[Page 8 of 26] &ntro!uction To Grouping Games Of Selection When "ou see games that .egin like this' 9ames is making exactly four of seven types of paint 1 apple re!5 .urnt siena5 gol!5 in!igo5 maroon5 na2" .lue5 an! tangerine 1 in accor!ance ith the follo ing con!itions%%% "ou shoul! imme!iatel" pickup on the fact that "ou are looking at a grouping game of selection% The ke" feature that sets selection games apart from other t"pes of games is that the si)e of the group that is to .e selecte! is either specifie!5 or that a limit is place! on the si)e of the group% &n the game a.o2e5 "ou are tol! that e+actl" four of the se2en t"pes of paint ill .e ma!e( in other or!s5 9ames is selecting a group of four from the se2en possi.le paints% Once "ou ha2e i!entifie! a game as .eing a Grouping game of Selection5 .e sure that the ne+t thing "ou figure out is hat the con!itions are on the si)e of the group selecte!% $l a"s keep track of the num.ers in grouping games% [Page : of 26] Step 1' Organi)ing $ Grouping Game Of Selection When organi)ing games of an" kin!5 .e sure to !o "our thinking .efore "ou !o "our riting an! !ra ing% Once "ou'2e thought through some of the conse,uences of the game5 then "ou can let "our sketching flo naturall" from "our thoughts on the game% &f "ou !ra first5 then "our un!erstan!ing of the game5 right or rong5 ill .e influence! ." that !ra ing% With that in min!5 let's organi)e a game' $nthon" is .aking exactly five of eight types of bread for his .aker" 1 .aguettes5 corn.rea!5 mar.le5 pumpernickel5 r"e5 scones5 hole heat5 an! ) ie.ack 1 in accor!ance ith the follo ing con!itions' Our task is clear' of the eight .rea!s5 e must choose fi2e to .e .ake!% ;otice that the game uses the or! 6e+actl"6' no more than an! no less than fi2e .rea!s are chosen% -ou shoul! train "ourself to look for uses of the or! 6e+actl"6 or the phrase 6must .e6 hen organi)ing games% When rea!ing games5 pa" special attention hen or!s like 6e+actl"6 an! 6must

.e6 are use!% These or!s shoul! stan! out like a .eacon in the !arkness 1 the"'re "our clue that "ou're a.out to .e tol! something 2er" important an! 2er" concrete% Step 2' <isuali)e $n! *ap Out

When "ou kno the e+act si)e of the group to .e picke! out of the pool of entities5 a set of !ashes in a ro is usuall" the .est *aster Sketch to use% On scratch paper5 =ot !o n ho "ou oul! 2isuali)e the follo ing game5 an! then click >ontinue%

$nthon" is .aking e+actl" fi2e of eight t"pes of .rea! for his .aker" 1 .aguettes5 corn.rea!5 mar.le5 pumpernickel5 r"e5 scones5 hole heat5 an! ) ie.ack 1 in accor!ance ith the follo ing con!itions' The sketch of the game looks like this'

&n grouping games of selection5 as "ou ork through a ,uestion5 "ou shoul! al a"s .e keeping track of num.ers% ?or e+ample5 in this game5 e are choosing five from a group of eight% What if a ,uestion ga2e "ou enough information to figure out hich three .rea!s are not .ake! ." $nthon"4 Kno ing hich three .rea!s aren't .ake! also tells "ou e+actl" hich five .rea!s are .ake!7 &t is not onl" important to keep track of num.ers as "ou organi)e a game5 .ut also as "ou go through each ,uestion% @emem.er that kno ing ho or hat isn't selecte! is =ust as informati2e as kno ing ho or hat is selecte!% The @ules' Think &n Groups When orking ith the rules5 "ou shoul! still gra2itate to ar! the most

concrete rules( .ut in grouping games5 "ou'll also ant to pa" close attention to the particular grouping of entities suggeste! ." the rules% #et's illustrate this point ith our .rea! .aking e+ample' @ea! an! learn the rules of the game5 a!!ing them all to "our master sketch% ?ocus on the concrete rules5 an! figure out hich clusters of entities are important% $nthon" is .aking e+actl" fi2e of eight t"pes of .rea! for his .aker" 1 .aguettes5 corn.rea!5 mar.le5 pumpernickel5 r"e5 scones5 hole heat5 an! ) ie.ack 1 in accor!ance ith the follo ing con!itions' &f .oth .aguettes an! hole heat .rea!s are .ake!5 ) ie.ack .rea!s are also .ake!% &f pumpernickel .rea!s are .ake!5 neither scones nor hole heat .rea!s are .ake!% &f r"e .rea!s are .ake!5 corn.rea!s are not .ake!% Of the three .rea! t"pes corn.rea!5 mar.le5 an! scones5 e+actl" t o are .ake!%

There aren't an" strictl" concrete rules gi2en% Ao e2er5 there are t o important groups of entities'

BCWCD are clustere! together ." the first rule% &f B an! W are chosen5 D is chosen as ell% >C*CS are clustere! together ." the fourth rule% This rule is also as close to concrete as this game gets% E+actl" t o of the three entities are

chosen% &f a ,uestion e+clu!es one of them5 the other t o are automaticall" chosen% &f t o of them are chosen5 the thir! is automaticall" e+clu!e!% $s "ou ans er the ,uestions5 keep an e"e out for BCWCD an! >C*CS% #et's *ake 3e!uctions ?inish organi)ing the .rea! .aking game ." making !e!uctions% $nthon" is .aking e+actl" fi2e of eight t"pes of .rea! for his .aker" 1 .aguettes5 corn.rea!5 mar.le5 pumpernickel5 r"e5 scones5 hole heat5 an! ) ie.ack 1 in accor!ance ith the follo ing con!itions' &f .oth .aguettes an! hole heat .rea!s are .ake!5 ) ie.ack .rea!s are also .ake!% &f pumpernickel .rea!s are .ake!5 neither scones nor hole heat .rea!s are .ake!% &f r"e .rea!s are .ake!5 corn.rea!s are not .ake!% Of the three .rea! t"pes corn.rea!5 mar.le5 an! scones5 e+actl" t o are .ake!%

*ost of the rules in this game are if0then statements 1 the !e!uctions to .e ma!e are the contrapositi2es% Be careful ith rule 1 1 .e sure to han!le the 6an!6 statement correctl"% @emem.er that hen negating an 6an!6 statement that the 6an!6 .ecomes an 6or6%

Fuestion 1' $ccepta.ilit" *an" grouping games .egin ith an accepta.ilit" ,uestion 1 this t"pe of ,uestion is a slam !unk5 as long as "ou remem.er to use the rules one ." one to eliminate the rong ans er choices% Write !o n the letters $5 B5 >5 35 an! E on "our scratch paper% ;e+t to each letter5 rite !o n the rule that knocks it out% Then click >ontinue% Which one of the follo ing coul! .e a complete an! accurate list of the .rea! t"pes $nthon" .akes4 G$H .aguettes5 corn.rea!5 mar.le5 hole heat5 ) ie.ack GBH .aguettes5 corn.rea!5 mar.le5 r"e5 ) ie.ack G>H .aguettes5 mar.le5 pumpernickel5 scones5 ) ie.ack G3H .aguettes5 mar.le5 r"e5 scones5 hole heat GEH corn.rea!5 mar.le5 scones5 hole heat5 ) ie.ack

G$H >orrect $ns er GBH @ule : G>H @ule 2 G3H @ule 1 GEH @ule / Write !o n 6B > * W D6 some here on "our scratch paper 1 it ma" come in han!" later% &f "ou starte! ith @ule 15 an! orke! metho!icall" through to @ule :5 "ou shoul! ha2e .een a.le to eliminate the rong ans er choices in short or!er% $ccepta.ilit" ,uestions are the easiest points to pick up on the #S$T 1 snatch them up ,uickl" an! mo2e on to the more challenging ,uestions% Fuestion 2' Partial $ccepta.ilit" Partial accepta.ilit" ,uestions are a little more interesting than accepta.ilit" ,uestions' in partial accepta.ilit" ,uestions5 "ou are aske! to figure out hich of the ans er choices contains a portion of an accepta.le group% -ou ma" nee! to use a little trial an! error5 .ut this t"pe of ,uestion can .e han!le! ." appl"ing the rules5 =ust like in accepta.ilit" ,uestions% Select an ans er an! then click >ontinue%

&f $nthon" .akes ) ie.ack5 hich one of the follo ing coul! .e a complete an! accurate list of the four other .rea! t"pes he .akes4 .aguettes5 mar.le5 r"e5 hole heat corn.rea!5 mar.le5 pumpernickel5 scones corn.rea!5 mar.le5 r"e5 hole heat mar.le5 pumpernickel5 r"e5 hole heat mar.le5 r"e5 scones5 hole heat

3i! "ou notice that this ,uestion is reall" no !ifferent than a straight accepta.ilit" ,uestion4 Since "ou kno that fi2e .rea!s are .ake!5 one of them has to .e ) ie.ack5 an! that each ans er choice contains four .rea!s5 "ou reall" ha2e the complete group of fi2e for each ans er choice% $ppl"ing the rules5 one ." one' @ule 2 eliminates choice GBH 1 $nthon" can't .ake .oth pumpernickel an! scones% @ule 2 eliminates choice G3H 1 $nthon" can't .ake .oth pumpernickel an! hole heat% @ule 8 eliminates choice G>H 1 $nthon" can't .ake .oth r"e an! corn.rea!% >hoice G$H 2iolates rule : 1 exactly t o of >C*CS must .e .ake!5 an! onl" mar.le is .ake! here% >hoice GEH remains5 an! it is correct% Be sure to note on "our scratch paper that 6* @ S W D6 is a 2ali! selection% Fuestion 8' $n 6&f65 6*ust Be6 Fuestion When a ,uestion presents a ne 5 concrete fact5 "our .est .et is to !ra a ne sketch echoing hat "ou alrea!" kno P#IS the ne fact%%%an! then !e!uce% Select an ans er an! then click >ontinue% &f $nthon" .akes r"e .rea!5 hich one of the follo ing is a pair of .rea! t"pes .oth of hich $nthon" must .ake4 .aguettes5 mar.le mar.le5 scones pumpernickel5 scones scones5 hole heat hole heat5 ) ie.ack

3i! "ou notice the 6must6 in the ,uestion stem4 $l a"s pa" close attention for phrases like 6must .e6 an! 6coul! .e6% &n this case5 the 6must6 tells us that as a conse,uence of the fact that $nthon" .akes r"e .rea!5 it automaticall" follo s from the rules that there are t o more .rea! t"pes he must .ake% $ ne sketch oul! look something like this'

We'2e place! the 6@6 right in the sketch% ;o conse,uences%

e must ork out the

3o the rules tell us an"thing positi2e a.out inclu!ing @4 -es5 @ule 8 states that if @ is .ake!5 > is not .ake!% #ook at our !ra ing no 1 if > is not .ake!5 t o of the fi2e slots must .e taken ." * an! S'

;otice that e ha2e re!ra n the list of entities5 an! are keeping track of ho is in5 an! ho is out% @emem.er to al a"s !o this hile ans ering ,uestions in Grouping games of Selection% &t ill help "ou keep track of num.ers5 hich e kno to .e important% &t is tempting to see if there are an" more !e!uctions to .e !ra n5 .ut remem.er the ,uestion 1 hich pair of .rea!s must .e .ake! if r"e is .ake!4 ;o e kno that there's a goo! chance that mar.le an! scones are the correct ans er% $ ,uick check of the ans er choices confirms this 1 choice GBH is correct%

6&f65 6>oul! Be6 Fuestions &n contrast to 6must .e6 ,uestions5 6coul! .e6 ,uestions suppl" a h"pothetical G6&f this is true5%%%6H an! then ask hat a possible conse,uence is G6%%% hich of the follo ing coul! .e true46H What !oes this mean4 &magine "ou are riting "our o n grouping game of selection% There are se2eral possi.le groupings that are possi.le .ase! on the

scenario an! rules "ou'2e ritten% -ou notice that ." a!!ing one more rule5 "ou can narro the num.er of possi.le selections !o n to t o or three% That ill make a prett" goo! 6if65 6coul! .e6 ,uestion' &f e suppose that one e+tra rule is in place5 hich of the follo ing coul! .e the selecte! group4 What "ou the test taker shoul! reali)e is that "ou are in the same position as the test maker5 onl" "ou're .eing time!% The time "ou spent organi)ing the game allo s "ou to ha2e an un!erstan!ing of the game close to that of the test maker% ;o "ou get to ork through the conse,uences of that one e+tra rule5 just like the test maker did when writing the uestion% The more "ou practice5 the .etter "ou'll .e at it% Go on to the ne+t page to tr" an e+ample from the .rea! .aking game% Fuestion :' $n 6&f65 6>oul! Be6 Fuestion Select an ans er an! then click >ontinue% &f $nthon" .akes .oth corn.rea! an! hole heat .rea!s5 hich one of the follo ing coul! .e a pair of .rea! t"pes .oth of hich $nthon" .akes4 .aguettes5 mar.le .aguettes5 r"e pumpernickel5 scones pumpernickel5 ) ie.ack r"e5 hole heat

$fter a.sor.ing the information in the ,uestion stem5 "our scratch ork shoul! look like this'

;o "ou can appl" the rules% Start ith W 1 is there a rule in2ol2ing W4 -es5 the contrapositi2e of @ule 2 sa"s that if W is .ake!5 then P is not .ake!% So that eliminates P% $re there an" rules that inclu!e >4 -es 1 the contrapositi2e of rule 8 sa"s that if > is .ake!5 then @ is not .ake!% $t this point5 our sketch looks like this'

There are onl" four entities left free5 an! t o of them are alrea!" accounte! for5 since either * or S ill .e chosen% That lea2es B an! D to fill the t o empt" slots'

The onl" ,uestion mark left is hether * is chosen or S is chosen% Entities >5 W5 B an! D are locke! in place% So the ans er ill most likel" .e * or S couple! ith >5 W5 B or D% $ns er choice G$H fits the .ill nicel"% Fuestion /' Ising Pre2ious Fuestions There ill .e a ,uestion or t o that can .e ans ere! the long a"5 or the short a"% Take this ,uestion5 for e+ample' $nthon" must .ake hich of the follo ing .rea! t"pes4 G$H .aguettes GBH corn.rea! G>H pumpernickel G3H r"e GEH ) ie.ack $pparentl"5 the rules of the game are sufficient to !etermine that one of the t"pes of .rea! must al a"s .e .ake!% The long a" to !o this pro.lem oul! .e to slog "our a" through the rules5 meticulousl" orking through all the possi.le scenarios% The easier path is to use the selections from the pre2ious pro.lems% &f "ou look .ack to "our scratch ork5 "ou'll see that "ou'2e alrea!" figure! out these groupings'

The common threa! of entities that must .e chosen are W an! D% This alone is enough to suggest that choice GEH is the correct ans er5 ho e2er e can .e sure of oursel2es ." noting that among our e+amples5 there is al a"s one that !oesn't inclu!e each of the entities in ans er choices G$H through G3H% ?or e+ample5 6B > * W D6 is a 2ali! selection that !oesn't contain @5 so choice G3H can't .e correct% Games With $ Selection Of &n!efinite Si)e One rinkle on the stan!ar! Grouping game of Selection that the #S$T likes to use is to allo the si)e of the selecte! group to 2ar"% Take the follo ing grouping game of selection through Steps 10: of the Kaplan *etho! for #ogic Games% Then click >ontinue to compare "our ork to our anal"sis% The cast of 2 musicals5 Big Top an! >ele.rate75 are to .e selecte! from among se2en au!itioners 1 #5 *5 ;5 O5 P5 F5 @% The follo ing con!itions go2ern the composition of the casts' Each cast must ha2e at least three mem.ers% # cannot .e in the same cast as P% &f P is in a cast5 O must also .e in the same cast% @ must .e in at least one of the casts% The t o casts must ha2e at least one mem.er in common%

The onl" !irect restriction on the si)e of the casts is that there must .e at least three people in each% ;otice that there are no restrictions on people ser2ing in .oth casts( in!ee!5 at least one person must .e in .oth casts% -our sketch shoul! look something like this'

Since the si)es of the groups are in!efinite5 ere merel" place! a 6GJH6 ne+t to the list of entities% Ao e2er5 e shoul! keep the num.er three in min! 1 each cast must .e at least that .ig% ;otice ho the rules are ritten in a compact5 eas" to rea! format% Fuestion 6' $ccepta.ilit" @emem.er ho to han!le accepta.ilit" ,uestions4 Write !o n the letters $ through E on "our scratch paper5 an! ne+t to each rong ans er5 rite !o n the rule that knocks it out% Then click >ontinue% Which of the follo ing represents an accepta.le selection of au!itioners for the casts4 G$H Big Top' #5 *5 ; >ele.rate7' *5 O5 P5 F GBH Big Top' #5 ;5 O >ele.rate7' *5 ;5 F5 @ G>H Big Top' #5 ;5 @ >ele.rate7' *5 P5 F5 @ G3H Big Top' #5 *5 F5 @ >ele.rate7' #5 ; GEH Big Top' #5 ;5 O5 P >ele.rate7' ;% F5 @

G$H @ule :' @ must .e in one of the casts%

GBH This is the correct ans er% G>H @ule 8' Since P is in the cast of >ele.rate75 O shoul! .e in that cast as ell% G3H @ule 1' The cast of >ele.rate7 has onl" t o mem.ers% GEH @ule 2' -ou can't ha2e .oth # an! P in the same cast% Fuestion J @emem.er that 6if65 6must .e6 ,uestions are sol2e! ." a!!ing the ne rules from the ,uestion stem to the game5 an! orking out ne !e!uctions% Select an ans er an! then click >ontinue% &f the onl" mem.ers of the cast to Big Top are *5 ;5 an! F an! if the t o casts are to ha2e as man" mem.ers in common as the con!itions allo 5 then hich one of the follo ing must .e true4 G$H The cast of >ele.rate7 an! the cast of Big Top ha2e e+actl" one mem.er in common% GBH The cast of >ele.rate7 an! the cast of Big Top ha2e e+actl" t o mem.ers in common% G>H The cast of >ele.rate7 an! the cast of Big Top ha2e an e,ual num.er of mem.ers% G3H The cast of >ele.rate7 has at least one more mem.er than the cast of Big Top% GEH The cast of Big Top has e+actl" t o more mem.ers than the cast of >ele.rate7

$fter a.sor.ing the ,uestion stem5 "our sketch shoul! look like this'

-ou are gi2en the entire cast of Big Top G* ; FH5 an! tol! that .oth casts shoul! o2erlap as much as possi.le% $re there an" rules that pre2ent all three of the mem.ers of Big Top from also .eing a mem.er of the >ele.rate7 cast4 ;o%

;otice that e aren't crossing off entities until e are sure here the" sit in terms of .eing mem.ers of both casts% $lso5 e're noting ho man" entities can .e in each cast' three in Big Top5 three or more in >ele.rate7% What other !e!uctions can .e ma!e4 We'2e alrea!" taken care of @ules 1 an! /5 .ut not @ule :% @ must .e in one of the casts% Since the cast of Big Top is full5 @ goes into the cast of >ele.rate7'

The remaining rules co2er entities #5 O an! P5 .ut those rules !on't tell us hether or not #5 O an! P are to .e inclu!e! in the cast of >ele.rate7 We'2e !one all the !e!ucing e can% So hich of the ans er choices must .e true4 >hoice G3H% >ele.rate7 must ha2e four or more cast mem.ers5 hile Big Top has e+actl" three% Fuestion K Aere's an 6if65 6coul! .e6 ,uestion 1 think like the test maker an! focus first on hat's certain5 an! then on hat's possi.le% Select an ans er an! then click >ontinue% &f the cast of Big Top consists of #5 ;5 F5 an! @5 an! if the cast of >ele.rate7 consists of *5 ;5 an! O5 then P coul! replace hich one of the follo ing cast mem.ers on a cast ithout 2iolating an" of the con!itions go2erning the composition of the casts4 G$H #

GBH * G>H ; G3H F GEH @

Start ." incorporating the h"pothetical G6if6H information into a sketch'

So the casts of .oth sho s are fi+e!% $pparentl"5 replacing one of the entities in the ans er choices ith P is legal( replacing each one of the other four is illegal% This is an accepta.ilit" ,uestion in !isguise 1 e can su.stitute P in for each of the ans er choices5 one at a time5 until e fin! a pair of casts that !oesn't 2iolate the rules% 3o e ha2e an" rules in2ol2ing P4 -es 1 @ule 8 states that if P is in a cast5 then O must .e in that cast as ell% Since O is a mem.er of the cast of >ele.rate75 e can onl" su.stitute P legall" into >ele.rate75 hich means it can replace onl" * or ;% Eliminate choices G$H5 G3H an! GEH% >hoice G>H has to .e rong as ell 1 ; is the onl" entit" that is a mem.er of .oth casts% &f P replaces ; on one of the casts5 then there on't .e an entit" in .oth casts5 2iolating @ule /% So P must replace * in the cast of >ele.rate75 making choice GBH the correct ans er% Fuestion L *ost ,uestions that aren't 6if6 ,uestions or ,uestions of accepta.ilit" are 6non0 if6 ,uestions5 an! ill in2ol2e the use of trial an! error to arri2e at the correct ans er% Fuestions like the follo ing call for "ou to start at one e+treme an! ork "our a" in% Select an ans er an! then click >ontinue%

The largest num.er of mem.ers that the cast of Big Top an! the cast of >ele.rate7 coul! ha2e in common is G$H three GBH four G>H fi2e G3H si+ GEH se2en

@ule 2 guarantees that "ou on't .e a.le to put all se2en entities in .oth casts5 since # an! P can't coe+ist% Since se2en cast mem.ers is out of the ,uestion5 hat a.out si+4 Start at the e+treme Gall se2en entities in each castH an! pull either # or P out'

;o check all the rules for either configuration% &t !oesn't matter hether "ou pulle! out # or P5 .oth groupings are accepta.le% The correct ans er is choice G3H% &n ,uestions that focus on e+treme 2alues of num.ers5 start at that e+treme an! ork in ar!s%

Games With *ultiple T"pes Of Entities $nother t ist the #S$T can thro into Grouping games of Selection is to pro2i!e !ifferent t"pes of entities Ge%g% 6&n a !eli5 there are fi2e t"pes of meat Gham5 turke"5 prosciutto5 salami5 roast .eefH an! four t"pes of cheese Gmo))arella5 che!!ar5 american5 gou!aH%%%6H% This a!!e! la"er of comple+it"

e+ists to e+pan! the num.er of rules that can .e applie!% Be prepare! for it5 an! it ill .e no s eat on Test 3a"% Take the follo ing Grouping game of Selection through Steps 10: of the Kaplan *etho! for #ogic Games% Then click >ontinue to compare "our ork to our anal"sis% $ li.rarian is creating a series of .ook !ispla"s% ;ine !ifferent .ooks are a2aila.le for the !ispla"s' three m"steries 1 $5 B5 an! > 1 three no2els 1 95 K5 an! # 1 an! three tra2el gui!es 1 P5 F5 an! @% ?or each !ispla" in the series5 the li.rarian ill select e+actl" fi2e of the .ooks5 in accor!ance ith the follo ing con!itions' &f t o of the m"steries are !ispla"e!5 the remaining m"ster" cannot .e !ispla"e!% There must .e e+actl" one no2el !ispla"e!% &f # is not !ispla"e!5 $ cannot .e !ispla"e!% &f @ is !ispla"e!5 $ cannot .e !ispla"e!% B cannot .e !ispla"e! if .oth K an! P are !ispla"e!% F cannot .e !ispla"e! unless .oth > an! 9 are !ispla"e!%

$fter "ou'2e ma!e "our !e!uctions5 "our *aster Sketch shoul! look something like this'

There are some important !e!uctions to .e ma!e from the first t o rules% There

is e+actl" one no2el !ispla"e!5 an! there can .e at most t o m"steries% >onse,uentl"5 the selecte! group must either consist of one no2el5 t o m"steries5 an! t o tra2el gui!es5 or one no2el5 one m"ster"5 an! three tra2el gui!es% There can't .e three m"steries !ispla"e!5 an! if no m"steries ere !ispla"e!5 then there oul! ha2e to .e four tra2el gui!es to fill the remaining four slots% ?urthermore5 no e kno that there has to .e at least t o tra2el gui!es !ispla"e!5 an! at least one m"ster" !ispla"e!% $lrea!" e'2e place! some serious restrictions on the game% Other ise5 there are plent" of if0then rules to keep things interesting% @emem.er that 6not M unless -6 reall" means 6if M5 then -6% Entities K an! P are a pair5 as are > an! 9% $lso5 entit" $ appears in t o rules5 so it ill .e fairl" important% Fuestion 1N Write !o n the letters $ through E on "our scratch paper5 an! ne+t to each rong ans er5 rite !o n the rule that knocks it out% Then click >ontinue% Which of the follo ing coul! .e the fi2e .ooks selecte! for a gi2en !ispla"4 G$H $5 B5 >5 95 F GBH $5 B5 95 #5 F G>H $5 >5 95 #5 @ G3H B5 >5 K5 P5 @ GEH B5 >5 #5 P5 @

G$H @ule 1' There can .e at most t o m"steries !ispla"e!( three m"steries are not allo e!% GBH @ule 2' There is e+actl" one no2el !ispla"e!5 not t o% G>H @ule 2' There is e+actl" one no2el !ispla"e!5 not t o% G3H @ule /' &f K an! P are !ispla"e!5 then B is not !ispla"e!% GEH This is the correct ans er% Write this !o n on "our scratch paper for future use%

Fuestion 11 Aere is a tougher partial accepta.ilit" ,uestion% -ou ma" nee! to use trial an! error to ork through the possi.ilities% Select an ans er an! then click >ontinue%

Which one of the follo ing is a list of three .ooks that coul! .e chosen together for a gi2en !ispla"4 G$H $5 95 P GBH $5 #5 @ G>H B5 K5 F G3H B5 F5 @ GEH >5 K5 F

On the face of things5 it looks like "ou'll ha2e to face each ans er choice an! rule it out in!i2i!uall"% But !on't forget' =ust .ecause "ou !on't ha2e the complete groups !oesn't mean that "ou can't tr" appl"ing the rules .efore "ou resort to trial an! error% >hoice G$H' &f $5 9 an! P are chosen5 then # must .e chosen Gcontrapositi2e of @ule 8H% But 9 an! # can't .oth .e !ispla"e!5 since onl" one no2el is allo e!% >hoice G$H is incorrect% >hoice GBH' @ight a a"5 e can use @ule : to eliminate this as a rong ans er% &f @ is !ispla"e!5 $ ill not .e% >hoice G>H' @ule 6 !eals ith F' if F is !ispla"e!5 > an! 9 must also .e !ispla"e!% But since K is alrea!" !ispla"e!5 an! onl" one no2el can .e !ispla"e!5 this must .e rong% >hoice G3H' We can start ith @ule 6 again% F is !ispla"e!5 so > an! 9 are !ispla"e! as ell% The selecte! group is no B > 9 F @% >heck the rules' there is nothing rong ith it% Write this !o n for future reference% >hoice G3H is correct 1 let's go on to check choice GEH5 for completeness% >hoice GEH' This choice fails ,uickl"5 for the same reason as choice G>H% &f F is !ispla"e!5 9 must .e !ispla"e! as ell% Since K has alrea!" .een chosen5 this ans er choice is rong as ell( "ou can onl" !ispla" one no2el% Fuestion 12 Select an ans er an! then click >ontinue% &f # is chosen for a gi2en !ispla"5 hich one of the follo ing is a pair of .ooks .oth of hich must also .e chosen for that !ispla"4 G$H $5 9

GBH B5 F G>H K5 P G3H P5 F GEH P5 @

This is an 6if65 6must .e6 ,uestion 1 the correct ans er must follo from the rules plus the information in the ,uestion stem% -our sketch after rea!ing the ,uestion shoul! look something like this'

There are t o a"s to get this pro.lem !one' Which rule applies to #4 @ule 8 1 ho e2er5 @ule 8 !oesn't appl" here% -ou can get some here5 ho e2er% The contrapositi2e to @ule 6 sa"s5 6&f > is not !ispla"e! or if 9 is not !ispla"e!5 then F is not !ispla"e!%6 9 is not going to .e !ispla"e!5 .ecause onl" one no2el can .e !ispla"e!% >onse,uentl"5 F is not !ispla"e!% @emem.ering ho crucial num.ers are to grouping games5 "ou can no assert that P an! @ ill .e !ispla"e!5 since at least t o tra2el gui!es are chosen% ?urthermore5 since all the tra2el gui!es are accounte! for5 the remaining t o slots must .e fille! ." m"steries% ;o that "ou ha2e ne concrete information5 "ou can start there% @ule : applies to @ 1 if @ is !ispla"e!5 $ ill not .e% >onse,uentl"5 the remaining t o m"steries5 B an! >5 are !ispla"e!% So5 hich t o .ooks must .e chosen for the !ispla"4 Onl" ans er choice GEH orks out 1 P an! @% Write !o n 6B > # P @6 1 "ou ma" nee! it% Aopefull"5 "ou are thinking5 6Wait a minute5 & alrea!" ha2e this ritten !o n76 Keeping ta.s on 2ali! selections of groups can .e a .ig time0sa2er on Test 3a"% &f "ou ha! reali)e! that "ou alrea!" ha! an e+ample of a selection ith # as one of the .ooks5 then "ou coul! ha2e ans ere! this ,uestion in no time flat% &t's OK if "ou ent ahea! an! sol2e! the ,uestion from s,uare one 1 =ust keep this lesson in min! for the future%

Fuestion 18 Select an ans er an! then click >ontinue% &f B is chosen for a gi2en !ispla"5 hich one of the follo ing is a pair of .ooks .oth of hich coul! also .e chosen for that !ispla"4 G$H $5 9 GBH $5 K G>H K5 F G3H #5 F GEH F5 @

This is an 6if65 6coul! .e6 ,uestion 1 make all the !e!uctions "ou can5 an! then e+plore the possi.ilities% &n this case5 some trial an! error ill .e in2ol2e!% $fter a.sor.ing the ,uestion stem5 "our sketch shoul! look something like this'

The contrapositi2e of @ule / ensures that either K is not !ispla"e! or P is not !ispla"e!% &t !oesn't mean that .oth K an! P aren't !ispla"e!5 although it allo s for the possi.ilit"% Be careful to al a"s interpret the rules correctl"% We can't get 2er" far on our o n ith this pro.lem5 so no consi!er each of the ans er choices in turn% e'll ha2e to

>hoice G$H' The !ispla" contains $5 B an! 9% Since 9 is in5 K an! # ha2e to .e out5 as there is onl" one no2el !ispla"e!% Ao e2er5 the contrapositi2e of @ule 8 asserts that since $ is !ispla"e!5 # must .e !ispla"e! as ell% >hoice G$H is incorrect% >hoice GBH' The !ispla" contains $5 B an! K% >hoice GBH is incorrect for the same reason that choice G$H is% >hoice G>H' The !ispla" contains B5 K an! F% Since K is !ispla"e!5 9 an! # are not !ispla"e!5 since onl" one no2el is chosen% @ule 6 then eliminates this ans er

choice5 since !ispla"ing F means that 9 has to .e !ispla"e! also% >hoice G3H' The !ispla" contains B5 # an! F% >hoice G3H is incorrect for the same reason as choice G>H% >hoice GEH' The !ispla" contains B5 F5 an! @% This ans er is correct% $ is not !ispla"e! G@ule :H5 .ut > an! 9 are G@ule 6H% The finishe! group is B > 9 F @ 1 an! it !oesn't 2iolate an" of the rules% [Page 2/ of 26] Fuestion 1: #et's en! this game ith a more !ifficult ,uestion% Select an ans er an! then click >ontinue% Which one of the follo ing .ooks >$;;OT .e chosen for an" !ispla"4 G$H B GBH 9 G>H K G3H P GEH @

$pparentl"5 it is possi.le5 =ust orking from the rules5 to !e!uce that there is a .ook that is ne2er !ispla"e! un!er an" circumstances% But5 as "ou ans ere! this ,uestion5 !i! "ou tr" to !e!uce hat .ook that is from s,uare one4 @emem.er5 man" times there's a har! a" to get there5 an! an easier a"% The easier a" to start is to go .ack to "our scratch ork an! collect all the accepta.le selections of .ooks from pre2ious pro.lems% The" are' B>#P@ B>9F@ #ooking at these t o arrangements5 "ou can imme!iatel" eliminate the four rong ans ers' B5 95 P an! @ can appear in a !ispla"% -ou !on't ha2e to go ahea! an! pro2e that K can't .e chosen for a !ispla" 1 "ou'2e eliminate! the other ans ers5 an! no "ou can mo2e on% [Page 26 of 26]

;e+t Steps ;o "ou'2e learne! a.out an! practice! Grouping games of Selection 0 .ut !on't stop learning an! practicing7 There are a fe sources of grouping games of selection for "ou to take a!2antage of'

-our Kaplan Aome Stu!" Book PrepTests Gnear the .eginning of the #esson Book is a list of logic games ." t"pe5 an! here the" appear in the PrepTestsH @e2ie ing games "ou'2e alrea!" !one Tr" riting "our o n game 1 un!erstan!ing ho ,uestions are ritten can help "ou figure out ho to ans er them

Keep on practicing5 an! goo! luck preparing for Test 3a"%