First Lesson
How a 1928 paper mathematically proved that bluffing is a rational, predictable strategy in two-person zero-sum games.
In the 1920s, a brilliant young mathematician named John von Neumann loved to play poker. He was not very good at it. However, his losses led to a massive breakthrough. He realized poker was not about math; it was about information.
Most games like chess are games of perfect information. Both players can see the entire board at all times. But poker is different. In poker, players hide their cards. This creates imperfect information, where the most important facts are kept secret.
Von Neumann saw that winning at poker required bluffing. To him, bluffing was not just a trick. It was a mathematical tool. If you never bluff, your opponents will always know when you have a strong hand and will fold.
Real life consists of bluffing, of little tactics of deception, of asking yourself what is the other man going to think I mean to do.— John von Neumann
To solve this, von Neumann created a simple model called the toy game. He stripped poker down to its bare bones. He proved that the best strategy must include a precise, random percentage of lies to keep opponents guessing.
max_x min_y K(x, y) = min_y max_x K(x, y)Theory of Games and Economic Behavior (1944) — Written by John von Neumann and Oskar Morgenstern, this book laid the entire foundation for modern game theory.
You've just read the opening lesson. Every module below, with quizzes, audio, and progress tracking, is waiting in STRATA.
Continue this course free →Full curriculum
STRATA turns any subject into a complete, structured course in seconds. Start this one — or build your own.
Open in STRATA →This course was generated by STRATA's AI at the request of a learner, then reviewed for our community guidelines. Content is for general learning.