Sunday 21 December 2014

Happy Christmas from the Weitzs and Mahjong News!   


KIRKLAND, Quebec (Canada) - Even though their Christmas Card has to travel all the way from Canada to Holland, Allan and Lila Weitz never fail, like Santa. For years, they have been the first to get their Christmas card in the postbox of Mahjong News. And then, we mean a real postbox, not a digital one.

Allan and his wife Lila Weitz are long time collectors of mahjong sets. They always picture themselves on the card they send their numerous friends, in Canada and world wide. E.g. last year, we saw them shopping and wearing T-shirts with the text ‘Mah-Jongg Sets Wanted’. This year, they pose behind some of their most beautiful mah-jongg cases.

Thank you so much for your faithful Season’s Greetings, Lila and Allan. Mahjong News seizes the opportunity to share your pretty card with all mahjong friends on the globe who are the visitors of the Independent Internet Mahjong Newspaper: Merry Christmas and a Happy New Year!

‘Full House’: the Solution

altDr. Watson had asked Sherlock Holmes how a hand with as many fans as possible can be constructed. Sherlock answered that he could solve that problem in less time it would take him than smoking half a pipe. Could you - even if you never smoke? Here’s the answer…

Question: Please, construct a hand containing as maximum of different fans.
Answer. Omitting reasoning here is a hand:

Concealed -- altaltaltalt, altaltaltalt, altaltaltaltaltaltalt, after replacing Kong alt comes (last tile from the wall and last tile of a kind):
1. 2= Prevalent Wind
2. 2 = Seat Wind
3. 2*1 = Pung of Terminals or Honors (two occurrences)
4. 16 = Three Concealed Pungs
5. 2 = Double Pung
6. 8 = Two Concealed Kongs
7. 4 = Outside Hand
8. 2 = Tile Hog
9. 1 = One Voided Suit
10. 1 = Closed Wait
11. 4 = Fully Concealed Hand
12. 8 = Out with Replacement Tile
13. 8 = Last Tile Draw
14. 4 = Last Tile
15. 8*1 = Flowers (8 ocurrences, not shown)
Totalling 72 pts on 15 different fans (altogether 23 fans).

Mahjong News | Copyright © 1997-2014 | About Us | Sitemap | Contact