Main   Puzzle 8S47 by Richard Pavlicek  

Right-Sided Club Slam

The fall meeting of Puzzlers Anonymous was canceled because of the pandemic, but this didn’t stop the fanatics from a virtual gathering. A video conference was scheduled, and I just logged in to see what was up. Oh my! From pandemic to pandemonium. The clangor of voices receded a bit when Professor Freebid noticed my presence.

“Richard! Glad you could join us! I was just showing Timothy a deal from one of your BBO matches:

Board 10.  ?
 ?
 ?
 ?
Both Vul West

2 H
Pass
Pass
North

?
?
?
East
Pass
Pass
Pass
South
1 NT
?
?
S Q J 10
H K Q 10 6 5 4
D K 6 5 4
C
Table S 9 8 7
H 9 8 7
D 9 8 7
C Q 8 7 6
 ?
 ?
 ?
 ?

“As South you opened 1 NT (15-17) and West overcalled 2 H. I forgot the entire auction, but you became declarer in 5 C and made six. While 6 C is hardly biddable, you played it from the right side, as only 11 tricks can be made with North declarer. I’m assuming best play and best defense all-around, of course.”

Yes, I remember it well from last week. My hand was…

“Whoa!” interrupted the Professor. “Don’t give it away.
I want Timothy and the gang to solve it as a puzzle.”

Fair enough. Perhaps my readers would be interested too:

Construct a South hand that makes 6 C only if played by South.

Multiple solutions exist. Tiebreaking goals are (1) for the combined N-S hands to have the lowest freakness, and (2) for South to have the lowest rank sum, in that order of priority.

Try it! It’s easy because you don’t have to analyze anything. Just enter a South hand, click Verify, and you will see your complete deal with its precise double-dummy analysis. If unsuccessful, change some cards and try again.


6 C North or
6 C South
North will
get what
remains
 
S Q J 10
H K Q 10 6 5 4
D K 6 5 4
C
Table S 9 8 7
H 9 8 7
D 9 8 7
C Q 8 7 6
 N-S cards:
S   
H   
D   
C   
S A K 6 5 4 3 2
H A J 3 2
D A Q J 10 3 2
C A K J 10 9 5 4 3 2


To submit a successful solution complete the form below. Entries will be accepted until November 25 (midnight GMT). You may submit multiple times, but only the latest one counts. The best solutions will be published here on Thanksgiving Day, with acknowledgment to all successful solvers.

Comment (optional)   One paragraph, no diagrams, 10 lines max


First name Last name Location

E-mail be sure correct to receive reply


TopMain

© 2020 Richard Pavlicek