Join Bridge Winners

Bridge Winners Profile for Andrzej Matuszewski

Andrzej Matuszewski
Andrzej Matuszewski
  • 28
  • 16
  • 233
  • 258

Basic Information

Member Since
July 21, 2012
Last Seen
4 hours ago
Member Type
Bridge Player
about me
Statistician with interests in: sociology, history, psychology, pure mathematics, ecology and MUSIC

Bridge Information

Regular Bridge Partners
Jerzy Orysiak, Tadeusz Skalski, Roman Krzemien
ACBL Ranking
subjective Standard Polish Club
Copy to my cards View/Print
Kyle Rockoff's bidding problem: Q2 K762 AK872 A4
There is here an experimental bid: 2. In 80% of cases we will play 2, which might be better than their 1N. Pd may have spades and in this case our 2 can be good.
Eric Sieg's bidding problem: AK JT7 JT863 QT6
This problem would be more difficult at IMPs.
Hanoi Rondón's bidding problem: KQTx x Kx KJT9xx
Double has only one disadvantage: pd can say 5 with 5 having 2-3 clubs. I estimate probability of this event to be 15-20%. It is not too much. And even within this event not all distributions of cards are against us. It is possible that 5x will cost ...
Jack Spear's bidding problem: A A32 A432 QJ432
dbl would be take-out?
Gonzalo Guridi's bidding problem: KJ9732 JT AK J62
I definitely can not accept any artificial bid (or gadget) that was not allowed by author of the problem. The only standard bid here is 3. Yes, it has many disadvantages. Taking this into account I propose here an alternative philosophy: the Hammann rule. "If you do not know ...
New Go Program
Every bidding system takes into account interference, even the simplest (negative double is not the simplest example). Chess opening player's book also does not finishes where it gives unique moves. It gives some "interesting" further moves and/or playing ideas. Of course the analogy is not easy and straightforward ...
David Boxley's bidding problem: --- 843 KT875 AKQ65
I must "correct" the first lead in case they will win the auction.
New Go Program
Eactly Ian! This is a chance for our game! We can discuss a hand very long time and we hope bots are not so inquisitive. But we can try to use them in our post mortems...
New Go Program
I'm not saying that after programming chess play (which is at successful end) we have an important advantage for programming bridge AT ONCE. 1. Similarity between debuts of both games gives nothing to programmer. They just finish: In chess debut finishes when the actual game enters the moves that ...
New Go Program
An obvious argument that chess is the game with complete information while bridge is not IS NOT VERY CRUCIAL. Complication of chess (especially in mid-game) is so great that one (also computer player) can find an optimal move rarely (in non-obvious environment). The same in mid-game of bridge. In end-game ...

Bottom Home Top