Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof

J. J. Colomina-Almiñana; P. R. Stinga

Home/Archive/arXiv

arXiv · 1804.05677

Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof

J. J. Colomina-Almiñana·P. R. Stinga

View original source ↗Read source document ↗Export metadata ↓

Abstract

A formal axiomatic mathematical framework for Boolos' Hardest Logic Puzzle Ever is presented and two theorems about its solvability are proved. By strictly following Boolos' instructions (in particular, the requirement that all gods are always obliged to answer), the novel concept of \textit{admissible questions} for the puzzle is introduced. It is then rigorously proved that Boolos' original puzzle can be solved, in an absolute deterministic way, in no less than three yes-no admissible questions. However, this does not mean that one could solve it in less than three admissible questions by just pure \emph{chance}. Hence, such probabilities are computed here as well.

Explore related subjects

math.HO

Keep this discovery

BibTeX RIS

J. J. Colomina-Almiñana, P. R. Stinga. 2018-04-12. Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof. https://arxiv.org/abs/1804.05677

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO↗

arXiv2026

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO↗

arXiv2026

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO↗