Poker Theorems

If you want to not only play poker, but also win some cash, you need to study our high-quality training articles on online poker strategy. In this section of the site you will find articles on basic and advanced poker strategy (mainly for no limit Texas hold'em), the strategies of tournament poker, as well as articles on the psychology of poker and poker math from well-known professional players.

Poker Theorems: What is that?

Poker theorems are usually useful or interesting statements that are based on the poker strategy, which can help us to play a better game in specific situations.

In other words, poker theorems tell us something like that: “if you are in X situation, then do X". These theorems should help you to win more money at the tables in specific situations, as well as save you from costly mistakes.

Are Poker Theorems Effective/Useful?

That’s a good question. Some of the poker theorems are very useful and will never lose their relevance, others will not be so useful, or have already lost their relevance. Some of the poker theorems may lose their relevance over time and lose their practical benefits.

Despite the fact that a number of theorems can be very useful in certain situations, it’s important not to rely entirely and completely only on these theorems, because winning poker players should use all their knowledge and skills together to take the most profitable decisions.

Poker Theorems

You will find a brief description of poker theorems below, evaluated on a scale of reliability/usefulness/value when playing No-Limit Texas Hold’em. Theorems are rated from 0 to 10 (10 is the highest rating available).

Name of the poker theorem: Fundamental theorem of poker
Reliability: 10/10
Brief description: This is a key theorem for poker players, invented by David Sklansky and described in his book “The Theory of Poker". The essence of the theorem is that every time you play with your pocket cards in such a way, as you have played them if you could see the cards of your opponent, you will win. Just imagine that if your opponent would see your cards, he would have played without any mistakes and would always win.

Name of the poker theorem: Zeebo's theorem
Reliability: 10/10
Brief description: Theorem says that no one can fold a full house, regardless of the bet size and full house strength. It is possible, that this theorem is the most reliable theorem in poker currently.

Name of the poker theorem: BalugaWhale theorem
Reliability: 8/10
Brief description: If you’re playing head-to-head with an opponent and are facing a raise on turn, you should re-evaluate the strength of your hand. This is a really good poker theorem, that will help you to avoid difficult situations on turn and river.

Name of the poker theorem: Clarkmeister theorem
Reliability: 8/10
Brief description: If you’re playing head-to-head with an opponent and the 4th card of the same suit was dealt on river when you should act first, you have to make a bet. Clarkmeister theorem will help you to pick a great opportunity for a bluff, however do not forget about your own observations about your opponents actions and do not fully rely on this theorem.

Name of the poker theorem: Yeti theorem
Reliability: 4/10
Brief description: Yeti theorem says, that a 3-bet on a dry flop (especially a paired one), almost always will be a bluff. Unfortunately, this theorem has somewhat lost its relevance, as players are becoming more and more aggressive and can easily play 3-bets on dry flops with quite a strong hands.

Name of the poker theorem: Aejones theorem
Reliability: 2/10
Brief description: Simply put, 'No one ever has anything'. As you can see, this is quite a “crazy" and funny theorem. However, there are some subtle and interesting moments in it. Are there any more poker theorems?

Perhaps there are some theorems popping up on forums time after time, but only a few of them will have a chance to live at least some decent time. However, you will encounter the aforementioned theorems quite often in forum discussions, so you better take time to remember them.