Assuming the Opposite to Crack a Puzzle

Many classic interview logic puzzles are far easier to solve backward than forward: rather than trying to directly construct or verify an answer, you assume the opposite of what you want to prove is true, then follow the logical chain of what that assumption would force to be true elsewhere, until it collides with something you already know is fact — at which point the original assumption must be rejected. A well-known example is proving that in any island of truth-tellers and liars, at least one native must be a truth-teller if the island isn't empty: assume instead that everyone is a liar, note that a liar claiming "I am a liar" would then be telling the truth (a contradiction, since liars never tell the truth), and conclude the "everyone is a liar" assumption is impossible.

This technique is a favorite in interviews specifically because it rewards a habit of mind rather than memorized formulas: candidates who reflexively try "suppose the answer were the opposite of what I expect" often find puzzles that look intractable head-on collapse quickly once approached this way.

It also underlies many "prove no strategy can guarantee a win" style questions: to show no arrangement or algorithm achieves some property, you assume one does, follow through its consequences step by step, and show two of those consequences can't both hold at once — at which point the supposed winning strategy is shown never to have existed in the first place.