Why the hardest logic puzzle ever cannot be solved in less than three questions

Publication Year:
Usage 391
Downloads 391
Social Media 5
Tweets 4
Shares, Likes & Comments 1
Repository URL:
Wheeler, Gregory; Barahona, Pedro
preprint description
Rabern and Rabern (2008) and Uzquiano (2010) have each presented increasingly harder versions of ‘the hardest logic puzzle ever’ (Boolos 1996), and each has provided a two-question solution to his predecessor’s puzzle. But Uzquiano’s puzzle is different from the original and different from Rabern and Rabern’s in at least one important respect: it cannot be solved in less than three questions. In this paper we solve Uzquiano’s puzzle in three questions and show why there is no solution in two. Finally, to cement a tradition, we introduce a puzzle of our own.