The impossible chessboard puzzle

The impossible chessboard puzzle

🎙 3Blue1Brown 👥 8.6M 📅 July 5, 2020 ⏱ 18 min 👁 2.1M 📄 science communication 🧭 2026-08-28
Available in: English (current) Français

Keywords

chessboard puzzlehypercubeHamming codeserror correctioninformation theory

Summary

The video presents a classic prisoner puzzle involving a chessboard with coins, where a prisoner must flip one coin to communicate the location of a hidden key to a partner. The puzzle is generalized to n squares, and the video explores the conditions under which a solution exists. Using a geometric interpretation, states are mapped to vertices of an n-dimensional hypercube, and flipping a coin corresponds to moving along an edge. The goal is to color the vertices such that from any vertex, all possible key locations are reachable in one move. The video proves that this is possible only when n is a power of 2, using a counting argument that shows the number of vertices of each color must be equal, leading to a contradiction for non-powers of 2. The proof is elegant and generalizes to higher dimensions. The video also visualizes the 4D case and hints at connections to error-correcting codes, particularly Hamming codes. The solution to the original puzzle is deferred to a companion video on Stand-up Maths.

172 words

Critical Evaluation

Value of the Information & Strength of the Argument

The video provides a clear and rigorous argument for the impossibility of the puzzle for non-powers of two. The geometric interpretation is powerful and makes the abstract concept accessible. The proof is well-structured, starting with simple cases and building up to the general result. The argument is solid and convincing, with no logical gaps. The video also highlights the connection to error-correcting codes, adding depth and relevance.

Scientific Rigor, Source Quality, Title Accuracy

The video is scientifically rigorous, with a clear and correct proof. The sources cited are primarily the companion video and the channel’s own resources. The title accurately reflects the content, which focuses on the impossibility aspect. The video does not rely on external sources but rather presents original mathematical reasoning. The content is well-researched and accurate.

138 words

Title / Content Match

The title accurately reflects the content, which explores the impossibility of the puzzle for non-powers of two and presents a proof.

Quality & Reliability

9/10

High-quality mathematical exposition with rigorous proof, clear visualizations, and references to related work. The content is well-structured and accurate, though it does not provide formal citations for all claims.

Chapters

Cited Sources

Concurring Sources

Contribution & Novelties

The video provides a novel and elegant proof of the impossibility of the chessboard puzzle for non-powers of two, using a hypercube coloring argument. It also visualizes the 4D case, making abstract concepts tangible. The connection to error-correcting codes is highlighted, offering a bridge to practical applications.

Pour aller plus loin :

  • Hamming code — Relevant to the error-correcting codes mentioned in the video.
  • Hypercube — The geometric object central to the proof.
  • Information theory — The broader field connecting the puzzle to data transmission.

85 words

Radar Profile

The radar profile shows high scores in information quality, technical level, and reliability, with a slightly lower score in information quantity due to the focused scope. This indicates a well-crafted, rigorous mathematical exposition.

Reliability 9/10

💬 Très positif. Sur les 30 commentaires analysés, les spectateurs expriment une admiration enthousiaste pour la clarté et la profondeur du contenu, avec des références humoristiques aux messages cachés et aux références culturelles.