Wheeler, Gregory and Barahona, Pedro (2012) Why the hardest logic puzzle ever cannot be solved in less than three questions. [Preprint]
Abstract
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.
Actions (login required)
![[img]](http://philsci-archive.pitt.edu/style/images/fileicons/application_pdf.png)
![[feed]](http://philsci-archive.pitt.edu/style/images/feed-icon-32x32.png){kind=icon}