The hardest logic puzzle ever becomes even tougher

2012/06/09 by Nikolay Novozhilov, Novozhilov, Nikolay
Computer Science · Mathematics · #Artificial Intelligence (cs.AI) #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #cs.AI #math.LO

paper · pdf · doi:10.48550/arxiv.1206.1926

arxiv created 2012/06/09 · openalex publication_date 2012/06/09 · arxiv updated 2012/06/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

"The hardest logic puzzle ever" presented by George Boolos became a target for philosophers and logicians who tried to modify it and make it even tougher. I propose further modification of the original puzzle where part of the available information is eliminated but the solution is still possible. The solution also gives interesting ideas on logic behind discovery of unknown language.

Related

• Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof
• An NL-Complete Puzzle
• A logical treatment of noise: Solving The Hardest Logic Puzzle Ever and its generalizations
• No information can be conveyed by certain events: The case of the clever widows of Fornicalia and the Stobon Oracle
• EnigmaEval: A Benchmark of Long Multimodal Reasoning Challenges