Archive
Explore the complete library by topic, difficulty, or title. You can also choose a topic.
It is one of those problems that invites us to list paths one by one. There is a much more elegant way to solve it.
A coin seems to leave plenty of room around it. Once the centers are joined, that room becomes a full turn divided into minimum angles.
A regular elimination, repeated in a circle, ends up hiding a surprisingly clean structure. The pattern takes a while to appear, but when it does it no longer admits of doubt.
Ana is a much better shot than Bruno. But once we know that exactly one of them hit the target, comparing their original percentages is no longer enough.
The equator contains infinitely many places, each with its own temperature. An exact match seems impossible to guarantee without measuring them all, yet the geometry of the…
Two envelopes conceal different amounts. Opening one seems to leave you entirely at the mercy of chance, yet that partial information can be used in an unexpected way.
The same family can look different depending on who is counting it. The trick is not to solve a large equation, but to remember that the speaker is part of the group too.
Cheryl entrusts the month to one and the day to another. When both speak, they do not describe what they know: they reveal, unintentionally, what they do not know. That's enough…
There is an old legend about the inventor of chess and a king who offered him any reward. The inventor asked for something seemingly simple: grains of rice, doubling the amount…
Sometimes, increasing something by 10% and then decreasing it by 10% does not take you back to where you started. This riddle comes from one of our readers, who proposed it from…
When several players cooperate under uncertainty, the key is not always to talk more, but to agree in advance who should speak and who should remain silent.
Two very simple mechanisms can be combined to achieve a precision that neither possesses on its own.
A game of chance can look like a tangle of possible paths. But if the game is fair, there is a way to see it without counting paths: your current money already contains the…
Ten results, no labels, and five weights to reconstruct.
Five numbers, two colors, and a single rule about sums. There seem to be many ways to distribute the colors, but every choice immediately constrains the next ones.
Ten trees must occupy twenty places across five rows. The escape is to let every tree work for two lines at once.
Four marks produce exactly six distances. Can you place them so that no measurement is repeated or wasted?
There are few problems so brief and so revealing. Here infinity is not presented as something enormous, but as something strangely flexible: moving everyone still leaves room…
When infinity appears, making room stops being a question of gaps and becomes a question of order. This problem has the rare joy of ideas that seem impossible and yet fit…
When the two hands are indistinguishable, the clock face no longer reveals which hand performs which role. Some images still determine one time; others connect two different…
Some puzzles hide no trick at all, only a kind of rhythm: each number appears twice, and each number demands that its own distance be written into the row.
A classic of delicate maneuvers: moving forward does not always mean getting closer to the solution, and each movement has consequences on both sides at the same time.
There are phrases that seem innocent until you examine who says them and when. If someone lies on some days and tells the truth on others, a single statement about yesterday can…
It is an elegant impossibility: it resists not because of excess combinations, but because there is something on the board that no coating can correct.
It belongs to the family of non transitive games in which choosing second is not a disadvantage, but rather a way of responding to the rival sequence with a better one.
Two eggs look exactly alike. You have only a table and your hands, yet one brief motion test is enough to reveal what each shell contains.
Four runners, four statements and a single lie. Identifying which of them fails leads directly to the order of arrival.
It is probably the most famous alphametic in mathematical recreation: a verbal sum that looks like a toy and ends up functioning as a chain deduction.
A single action, a single idea, an exact result.
Three cords are tied inside a bag without being seen. The outcome feels unpredictable, but there are only fifteen final pairings, and they can be counted exactly.
Sixteen possibilities and one answer that may be false. All questions must be fixed before the game begins.
It's a conversation that builds slowly, as only good logical problems do. Each sentence does not provide new information: it erases possibilities.
The clue is not always in what moves. Sometimes it is in what remains calm. In this square, a coin falls into the water at a precise moment — and that moment has a signature.
Ten bags and one weigh is one of those puzzles where the way you ask the question matters more than the amount of calculations. The elegant solution does not multiply…
The problem seems to advance by successive movements, and the natural temptation is to explore sequences. But the answer comes before starting to try combinations.
It has the appeal of patterns that seem almost visible and yet slip away for a moment longer. There is no hidden algebra: the key is in how each term is observed.
This game looks psychological: guessing what other people will think. But if everyone reasons perfectly, the crowd collapses toward a single number.
The scene seems doomed to trial and error: you know how many coins are face up, but you can't recognize any by touch. The surprising thing is that the solution does not depend…
It is not a problem of bravery or patience, but of worst case design. All its elegance lies in finding a plan that shines not when everything goes right, but when everything…
A short statement can hide more than it seems. Here a careless reading is enough to arrive at the wrong answer; A careful reading, on the other hand, resolves it effortlessly.
Two needles have the same length. One is straight; the other may be bent at will. Can a clever shape outwit chance?
Some traps do not need to hide their rules. On the contrary: they work precisely because everyone can see the rules, and once you are inside, each small step seems reasonable.
Four bells, four strings, and a seemingly simple question. Before trying random combinations, it's worth asking yourself if the goal is even achievable.
Ninety nine infected squares on a board of ten thousand. If you place them cleverly, can the infection take over every last square?
A problem that invites you to calculate, but the calculation is not what matters.
A boat, a lake, a handful of steel marbles. The question seems like a physics one, but the answer depends on something more subtle than simple weight. It is worth thinking about…
This riddle looks so easy that it almost invites you to answer without thinking. But the important phrase is not the total price; it is the difference between the two items.
It looks like a locksmithing problem, but it is really an exclusion problem. Do not first think about who must be able to open the box; think about who must be blocked.
Crossing a bridge at night with just one flashlight seems like a speed problem. Maybe it's not entirely.
One stick, two random cuts, three pieces. A simple question to ask whose answer usually surprises.
Sometimes the mistake is not in counting badly, but in looking at a flat object when it actually has volume. A cake is not just a circle: it also has height.
Dividing a cake among three people does not mean everyone measures value the same way. One person may value the chocolate more, another the edge, another the fruit. Fairness is…
Removing a number from one group and adding it to another seems as if it must raise one average and lower the other. But there is an interval where exactly the opposite happens.
Seven people sit in a circle, and each makes the same accusation about the person to their right. Sometimes the shape of a problem matters more than the words.
The Chinese Farmer's Riddle comes from the tradition of well told problems: a simple framework, a clear difficulty and a solution that seems almost obvious when it has already…
One chocolate bar, forty eight squares, and an irresistible temptation to find the perfect sequence of breaks.
Someone may freely choose ten numbers. You promise that, hidden among all their possible subsets, you will find two separate groups with exactly the same total.
A clock has two hands that do not rest. It seems easy to count how many times they are found, but the number that almost everyone says is not correct.
When a clock strikes, the important thing is not the number of chimes, but the gaps between them. That is the little trap.
A four digit code leaves three traces: a sum, a multiple, and what happens when you read it backwards. Three conditions for a single number.
Intuition usually imagines that a coin going around an identical coin makes one full turn. But as it rolls, it does not only move forward: it also rotates along the path it…
Sometimes a figure can be transformed completely by moving very little. Here, three coins are enough—provided you find the exact positions.
Some processes look as though they could go on forever: you fix one thing, disturb others, and the game starts again. But sometimes there is a hidden measure that always…
There are properties that hold for any possible choice, without exception. This riddle invites you to find why a certain outcome is inevitable, whatever the starting point.
Two mathematicians, a visible route number, and a single denial that reveals one passenger's age.
Winning an election does not mean having led throughout the count. This puzzle asks for something finer: not just who wins in the end, but how often the lead was never even…
A rectangle of chocolate may seem like a calculation problem, but the right question is not how long the bar is: it is whether the first player can guarantee victory, and why.
A desert for six days, provisions for four. Arithmetic seems to prevent the crossing from the beginning. The challenge is to find a way for at least one to get to the other side.
Two dice can carry different labels and still leave exactly the same fingerprint when their results are added.
Every split produces a different number and opens new possibilities. The total seems to depend on the chosen path—until you discover what each product is really counting.
A safe usually suggests a long list of separate attempts. But if the lock keeps checking only the last few digits typed, one continuous sequence can hide every possible code…
Like Plato's Meno, this small structure illustrates a very clear geometric concept: doubling an area does not mean doubling a side.
In a duel, it seems natural to aim at the most dangerous enemy. But if you are the worst shooter, your best defense may be not looking like a threat.
There are weights that no conventional scale can measure. Sometimes the solution is not to look for a bigger scale, but to think differently.
In a tournament like this, following the table game by game is more distracting than it helps. The question becomes clearer when you look at what really changes after each…
Some puzzles do not hide a difficult calculation, but a badly framed sum. Everyone here knows how to add, yet almost everyone adds things that should not be added.
When the number of colors increases, the problem stops being a simple game of immediate deduction and begins to require a much finer form of coordination. His interest is in how…
One of the minimal gems of randomness: extracting perfect justice from a biased source without knowing the bias.
It is one of the best miniatures of fair distribution: it seems like elementary arithmetic, but it forces us to distinguish between what each one carried and what he really…
A two pan scale does not give numbers: it only says left, right or balance. The challenge is to squeeze these three answers to locate one coin out of twelve and know if it…
Two random arrivals, a one hour window, and only fifteen minutes of waiting. The answer is hidden inside a square.
We usually think that if a message arrives with an error, at most we can detect that something went wrong. But some codes do something more elegant: they point to exactly where…
A game can last many rounds, but sometimes it is understood by looking only at the first cycle. If nothing happens at the start, the game returns exactly to where it began.
In this family of puzzles, pirates vote not for justice, but for survival and self interest. The approval rule has a peculiarity that changes the entire reasoning.
In this family of puzzles, each pirate weighs not only what he gets now, but what he would get if the proposer were eliminated. The approval threshold changes everything.
Its fame is born from a gentle trap: intuition pushes towards an endless calculation of twists and turns, but the problem has a much more direct solution.
This problem is a short, sharp lesson in what it means to check a rule. The winner is not whoever turns the most cards, but whoever rigorously distinguishes which ones could…
Four people, four hats and a wall in between. Every silence in this problem says as much as an answer, and following the thread of what each prisoner can or cannot see is the…
A curved chase with four participants and a symmetry that is not broken at any time.
In some games, the winner is not the one who rushes fastest toward the goal, but the one who knows from which squares the goal is already controlled. The key is not to start…
One of the most famous riddles about guardians who tell the truth or lie. The usual trap is to try to figure out who is who before asking. There is a more elegant way.
A hat falls into a river, and its owner takes half an hour to notice. An essential piece of information seems to be missing, but a change of reference frame is enough.
Each prisoner is missing exactly one piece of information: their own hat. Pairing them turns two uncertainties into one guaranteed correct answer.
Many hat puzzles have only two colors: white or black. But the deep idea in this problem does not depend on having just two options. Even with infinitely many possible colors, a…
It is a miniature reconstruction: each figure seems local, but ends up fixing the entire row. The pleasure is in watching a dry sequence become almost inevitable.
Many numbers can be broken into a staircase of consecutive positive integers. The challenge is to identify the one family that never allows such a decomposition.
One hundred people, one hundred boxes, and no chance to communicate once the game starts. At first glance, the odds seem overwhelming. However, there is a strategy that…
One hundred logicians make one hundred statements about themselves. Only one can survive scrutiny.
This is a problem of collective discipline under a severe restriction: one word per person and almost no second chances. Its beauty appears when the prisoners stop trying to…
There are problems that are solved not with more effort, but with a single idea that inverts everything. This is one of them.
Sometimes a seemingly minor rule is enough to make impossible what seems only difficult. The key is to find what remains invariant.
Some numbers look impossible only because we are still too low. With two suitable stamp values, there comes a point after which impossibility disappears forever.
One person can have perfectly consistent preferences. But when many people vote together, the majority can behave cyclically. This puzzle reveals an elegant crack in the idea of…
How many different groups can coexist under rules that seem almost harmless? Parity conceals a surprisingly rigid limit.
Hat puzzles are already strange with many prisoners. With infinitely many, an even stranger idea appears: do not try to save each prisoner separately, but arrange that everyone…
A simple framework, a clear difficulty and an exit that seems almost obvious when it has already been seen: these are the best distribution problems of the Arab tradition.
Finding one special person among a hundred seems to require many checks. But a good question does more than give information: it also eliminates candidates.
It seems impossible to hit an invisible target that could have started at any integer position and moved at any integer speed. However, the impossibility has a crack.
This issue does not add private information; it adds something subtler and more powerful: common knowledge. That is why its solution seems slow and, at the same time, relentless.
Four says, four faces with their own values. At first glance, it seems like a matter of choosing the strongest. But there's something strange about how they relate to each other.
It looks like a cruel game that can only be solved by simulating eliminations one by one. But the circle has binary memory: when the even positions disappear, the problem starts…
When someone cheats, sometimes you do not need to accuse them. You only need to force the cheater to accept the consequences of their own lie.
Three inhabitants, three different natures and a single possible assignment. Here, unlike other island puzzles, there is a type of inhabitant whose behavior does not follow any…
Sometimes the solution is not in what you do after starting, but in how you start. If you place your body correctly before touching the rope, the knot almost appears by itself.
Sometimes it seems impossible to improve on a random choice. If you know nothing about two numbers, choosing one of them should give you exactly a 50% chance. This puzzle…
The process seems chaotic: each extraction depends on chance and the balls come and go. However, the final answer is completely deterministic from the first moment.
A problem of transfers and invariants disguised as buckets and marbles: the move looks local, but the decisive idea is global.
On this island, every encounter changes the balance of colors. The challenge is to determine which endings can actually be reached.
One rule changes the game: here, the player who takes the last counter loses. The challenge is to find a first move that is not merely plausible, but actually leaves the…
A classic probability problem that defies intuition: the answer is the same for any number of passengers, and arriving at it requires looking at the problem from the right angle.
One hundred people cannot communicate with each other. Their only link to the outside is a light bulb that they can find on or off. The difficulty is that no one knows what…
Lo Shu is one of the oldest and most elegant magic squares. With only the numbers 1 through 9, it forces rows, columns, and diagonals to obey the same sum: 15.
We can choose at random between two options, between a hundred, between a million. But when we want all positive integers to have exactly the same chance, randomness breaks.
Five cards enter the scene. One disappears, and the other four reach the magician in a carefully chosen order. There are no words, gestures, or marked cards.
When some people are truthful and others lie, a single answer can mislead you. But if you know how to pair answers, lies can cancel out truths.
A map may be rotated, shifted, and placed almost any way you like. Even so, one coincidence cannot be avoided.
It is a social and logical piece at the same time: each answer fits with the others until the party is secretly ordered. The solution doesn't count one to one squeezes; discover…
It has the feel of an ancient problem done right: a merchant, a balance scale, and the need for perfect precision. The beauty here is not in testing combinations one by one, but…
It is a supply problem more than a road problem. Each day won seems small, but it forces you to pay in advance for increasingly expensive logistics.
Average speeds are treacherous. Sometimes they cannot be made up for—and by the time you notice, all the time is already gone.
Four tablets that are identical to the touch, two colors that are impossible to distinguish, and the obligation not to make mistakes. There is a way out, but it requires…
One hundred people know almost everything: they see other people's numbers, but not their own. Without communicating after knowing the numbers, each one must predict theirs. The…
A trail, two days and a conclusion that seems impossible to guarantee until you find the right angle to look at it.
It seems that, with two doors closed, everything comes down to fifty fifty. However, the odds are not equal: the way the presenter chooses which door to open changes everything.
His fame is not exaggerated. It brings together three different difficulties in a single knot—truth, lies, and unknown language—and demands a solution that neutralizes them at…
Sometimes collective information reveals something that no individual response could confirm.
Fairly dividing a mixed necklace seems to require separating beads one by one. The question is whether the continuity of the circle itself can do the work.
Nine dots form a perfectly familiar figure. Four strokes seem almost sufficient, yet every natural route leaves something behind.
Ships keep leaving toward you throughout your seven day journey. The difficulty is remembering the seven ships that left B during the previous seven days.
It seems like a numerical oddity, and it is; but not in the capricious sense. It has that special grace of problems in which each figure imposes conditions on all the others.
Some numbers seem to have an internal choreography. Move one digit, and instead of becoming scrambled, the number turns into exactly twice itself.
A zero seems to be worth nothing. But placed in the middle of a number, it completely changes the value of its digits. Here the zero does not add: it shifts.
When every rejection is irreversible, choosing well begins with knowing when not to choose. An initial sample can become the standard used for every later decision.
One number is visible and another remains hidden. You may ask for no further information, but the value you have seen may already reveal more than it seems.
Sometimes a family phrase looks like a maze only because we read it too quickly. This riddle hides nothing: you only have to translate each relationship without adding relatives…
Few puzzles have generated as much debate as this one. The answer seems obvious in one sense, and it also seems obvious in the other way. It is worth stopping before deciding.
An even split seems like the safest choice. Here, however, the best strategy creates one perfect opportunity and concentrates the remaining risk in the other urn.
A 10% head start is not always offset by running 10% faster. The trap is to notice how much distance each runner actually has to cover.
Four spies share secrets over the phone: each call updates both participants on everything the other knows. The question is how many calls are enough for no one to ignore anything.
A list of remainders can look like a set of unrelated conditions. Sometimes they are all saying the same thing in disguise.
A classic problem about circles that defies intuition: the result does not depend on what one would expect.
Fifteen meters of rope for a twenty meter drop. At first glance, the numbers do not add up.
Rotation erases the identity of each cup, but it cannot erase the geometry: pairs remain adjacent or opposite. The strategy works by reducing the possible configurations until…
This riddle became famous as an interview question because it seems everyday, but it forces you to reason about geometry, safety, and practical use. The main answer is not in…
Twenty visible coins, two ends, and one question: can the first player avoid defeat, whatever the opponent chooses?
A two pan scale seems like a simple tool. But when the uncertainty is double—you don't know which ball is different or whether it weighs more or less—a single weighing may not…
A blacksmith, a chain and seven days of work: the most elegant solution is not always the most obvious.
In a room filled with different dates, a single match is enough. The question is how many people are needed before a match becomes more likely than no match at all.
It is a minimal classic against haste. Almost everyone does the math too quickly and gives the snail a night it no longer needs.
Sometimes a question looks like it is about cars, but it is really about conservation. It does not matter how you rotate the wheels: what matters is how much total tire life you…
Some numbers leave a signature when multiplied by themselves. They hide at the end of their own square, as if the calculation returned them intact.
The scene is social, but the problem has a more rigid structure than it seems. It is worth asking what restrictions the distribution of squeezes actually imposes before answering.
One hundred ants, one meter stick, and a simple rule when they meet. The result seems to depend on everything — positions, directions, collisions — but there is something that…
Two points, a straight riverbank, and one required stop. The optimal route appears when the problem stops looking like a detour.
A million switches, a million light bulbs, a million passes. The question seems monumental, but it boils down to something much more intimate: the individual history of each…
A test can be very reliable and yet a positive result may not mean what it seems. The mistake is to look only at the test's accuracy and forget how many healthy people there are…
This puzzle belongs to the classic family of hat problems, a tradition of logic where the decisive information is not always in what is seen. The third blind wise man variant…
Rarely does such a short problem open up such a big idea. Here it is not whoever tries the most who wins, but rather whoever makes the most of what each rat can say.
Three logics, one simple question and three answers. The last one is a categorical “yes” — although no one has said anything directly to him.
Three boxes, three labels, and they're all wrong. With a single gesture—removing a single fruit from a single box—it is possible to know the contents of all three. The question…
Three prisoners see each other's hats, but not their own. The first one in line, who doesn't see any hats, is the one who finally answers.
Three switches, a light bulb in another room, and only one chance to get in to see it. It seems like there's not enough information — until you realize that the light bulb can…
The Three Vessels of the Sage belongs to the great tradition of problems that seem narrative and turn out to be exact. It preserves that ancient flavor in the statement, but…
Before the World Cup began, the Argentine creator Valen Scarsini , known as El Scarso , launched an irresistible idea: to find the least known footballer in the tournament and…
In a short league, five teams face each other against each other. In the end, neither pair of teams shares a score. The question is how far the fourth placed team can go.
Few pieces unite mechanism and growth so well. Each movement is simple; The amazing thing appears when that simplicity is repeated until an unexpectedly large quantity is produced.
Under its everyday appearance, this problem is an exercise in logical precision. It all depends on reading the rules carefully and not losing track of what happens step by step.
A ruby can belong to two people, but it cannot be split without losing its value. Justice, then, does not consist in cutting the stone, but in finding a compensation that both…
Moving three consecutive tiles seems like a wide freedom. But not all rearrangements are achievable, and the reason is more subtle than it seems.
This riddle looks like a question about a bridge's weight limit, but it is really a question about the exact moment at which you look at the scene.
Twenty five horses, a track with five lanes, and no stopwatch: you only know who arrives before who within each race. The question is how many races do you need to be completely…
One has been unemployed for years. The other one at least walks, although he arrives a little later every hour. Before judging which misses the most, it's worth asking yourself…
A miniature of tribal logic where a single phrase—and what was not heard before—decides everything.
A game of removing stones can look like a long, boring subtraction. But if you look at what never changes, a hidden measure appears and governs the whole process.
The strings are not clocks: they burn capriciously, without respecting proportions or halves. And yet, with just a lighter and some ingenuity, they can measure time precisely.
A two cube calendar seems impossible: too many dates and too few faces. But the days of the month do not demand all digits equally. Some digits must be duplicated, and one digit…
It is a small and very clean paradox: a coin, a toss and new information are enough for intuition to begin to distribute the probabilities incorrectly.
Every pair either know each other or do not. How many people make a triple of one type unavoidable?
Pólya's urn is a classic example of reinforced randomness: whenever a particular color comes up, it becomes slightly more likely to come up again. The question is whether that…
Sometimes a single visible piece of information is enough to change the weight of an entire situation. This riddle is deeper than it seems.
A problem with an unusual quality: the desired quantity does not exist in any jar, it must be built. Every transfer matters, and the order is not arbitrary.
Eight players and twenty eight decisive games. The challenge is not to identify the best player, but to chain the victories.
It has the charm of old scale problems: few movements, very expensive information and a solution that must be clean from the beginning. It does not ask for brute force, but for…
A wobbly table seems to call for a wedge, a folded napkin, or a different spot. But sometimes simply rotating it is enough: the irregular floor forces a balanced position to exist.
A river, a small boat and three passengers who cannot stay with just any company. The farmer will have to come and go more times than seems necessary.
There are geometric probability problems where the exact answer emerges from a surprisingly straightforward argument. This is one of them.
You don't always need to share a key to send something securely. Sometimes it is enough to use each other's locks in the correct order.
Twenty people may stand in any order. Even so, two apparently different counts always end in a perfect tie.
Being allowed to move and stack the pieces changes the count completely. But finding an efficient procedure is not enough: we must also prove that no shorter one can work.
You may split the numbers however you like. Once the two groups are sorted in opposite directions, the final sum no longer depends on your choice.
The same rectangular sheet can be turned into two very different cylinders. The amount of material does not change, but that does not mean their capacities must be equal.
A sheep must choose between two islands full of lions. To survive, it must reason exactly as they do.
Two prisoners, a chessboard, 64 coins and one secret square. Can a single flipped coin always reveal which square was chosen?
Two glasses, two transfers and a seemingly very simple question. It is one of those riddles that invite you to calculate right away, although the decisive factor does not always…
A percentage changes just one point. The weight, however, does not react with timidity. This riddle is small and leaves a mark.
A seemingly simple decision—how to distribute one hundred balls into two boxes—hides a strategy that defies instinct. It's worth stopping before handing out.
This is a classic deduction in its purest form. Your pleasure does not depend on a single brilliant track, but on seeing how a well ridden board turns many small certainties…
Three footballers, three national teams, and a survey that looks straightforward. But there is a small logical trap...
No ads. No algorithm. Just editorial care.