TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Cain's Jawbone: Puzzle solved for just third time in almost 100 years (2020)

158 pointsby mmettlerover 3 years ago

13 comments

dangover 3 years ago
Past related posts:<p><i>Beastly Clues: T. S. Eliot, Torquemada, and the Modernist Crossword</i> - <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=29911071" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=29911071</a> - Jan 2022 (3 comments)<p><i>Literary puzzle solved for just third time in almost 100 years</i> - <a href="https:&#x2F;&#x2F;www.theguardian.com&#x2F;books&#x2F;2020&#x2F;nov&#x2F;10&#x2F;literary-puzzle-solved-for-just-third-time-in-almost-100-years-cains-jawbone" rel="nofollow">https:&#x2F;&#x2F;www.theguardian.com&#x2F;books&#x2F;2020&#x2F;nov&#x2F;10&#x2F;literary-puzzl...</a> (via <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=25045947" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=25045947</a> - Nov 2020, but no comments there)<p>Edit: maybe we&#x27;ll switch to that latter article from <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Cain%27s_Jawbone" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Cain%27s_Jawbone</a>. Wikipedia pages are fine when the topic is unpredictable (like this one!) and there isn&#x27;t a good third-party article available (<a href="https:&#x2F;&#x2F;hn.algolia.com&#x2F;?dateRange=all&amp;page=0&amp;prefix=true&amp;query=by%3Adang%20wikipedia%20submission&amp;sort=byDate&amp;type=comment" rel="nofollow">https:&#x2F;&#x2F;hn.algolia.com&#x2F;?dateRange=all&amp;page=0&amp;prefix=true&amp;que...</a>).
thaumaturgyover 3 years ago
Here are some pictures of some pages:<p>p.15: <a href="https:&#x2F;&#x2F;i.imgur.com&#x2F;xKRESSL.jpg" rel="nofollow">https:&#x2F;&#x2F;i.imgur.com&#x2F;xKRESSL.jpg</a><p>p.23: <a href="https:&#x2F;&#x2F;i.imgur.com&#x2F;ODDenKQ.jpg" rel="nofollow">https:&#x2F;&#x2F;i.imgur.com&#x2F;ODDenKQ.jpg</a><p>p.93: <a href="https:&#x2F;&#x2F;i.imgur.com&#x2F;0vAvWYt.jpg" rel="nofollow">https:&#x2F;&#x2F;i.imgur.com&#x2F;0vAvWYt.jpg</a><p>I suspect page 23 continues onto page 93, but that&#x27;s about as easy as this puzzle ever gets. Each page begins and ends in whole statements and there&#x27;s not, for example, any dialogue split between pages. The occasional poem fragment is the only easy clue you get.<p>The rest of it likely requires paying attention to the subject(s) and setting on each page and gradually assembling them. I have no expectation of ever solving it, and if I ever do get the pages into some kind of order, I doubt I&#x27;ll be completely confident about my answer.<p>Some kind of NN model could probably be constructed that would do a pretty good job of getting it mostly in order. Somebody else might find that to be a fun problem, but I picked it up for its potential to be a long-term amusement.
评论 #29974246 未加载
评论 #29974944 未加载
评论 #29974427 未加载
评论 #29976422 未加载
p1neconeover 3 years ago
The article talks about the number of possible page combinations as if it&#x27;s a meaningful indicator of difficulty, but I don&#x27;t think it really is unless you&#x27;re actually trying to brute force the solution.<p>If you aren&#x27;t just brute forcing it then the difficulty depends much more on the clues given to you in the book. (For a trivial example imagine if the pages were numbered - technically still roughly 10^157 possibilities, but it would be very easy to solve).
评论 #29973674 未加载
评论 #29974188 未加载
评论 #29976462 未加载
评论 #29975458 未加载
mr_gibbinsover 3 years ago
Possibly the first time I&#x27;ve ever laughed out loud at something in the Guardian:<p>&quot;“The first time I opened the box, I swiftly concluded that it was way out of my league, and the only way I’d even have a shot at it was if I were for some bizarre reason trapped in my own home for months on end, with nowhere to go and no one to see. Unfortunately, the universe heard me,” Finnemore said.&quot;
cocomutatorover 3 years ago
I wonder how a modern language model would fare here -- use something like GPT-3 to evaluate the log likelihood gain of stitching together each of all N^2 possible pairs, then merge greedily best matches until none are left. Totally within reach, I bet it could get at least _some_ of the order right.
gnabgibover 3 years ago
“The first time I opened the box, I swiftly concluded that it was way out of my league, and the only way I’d even have a shot at it was if I were for some bizarre reason trapped in my own home for months on end, with nowhere to go and no one to see. Unfortunately, the universe heard me,”<p>Finally it&#x27;s working for someone!
评论 #29972790 未加载
Someoneover 3 years ago
FTA:<p>- Just two readers managed to solve the puzzle in the 1930s<p>- three years ago […] Shandy Hall curator Patrick Wildgust embarked on a mission to solve it. Once he did<p>- John Finnemore […] was […] the only one to get the answer right.<p>⇒ at least the fourth time.
评论 #29972829 未加载
Pyramusover 3 years ago
After studying this discussion it seems that the puzzle has been solved several more times: There is an active subreddit dedicated to it [1], with a handful of people credibly claiming to have solved the puzzle.<p>So &quot;solved for just the third time&quot; is likely not technically true, but the puzzle does seem to be very very difficult.<p>[1] <a href="https:&#x2F;&#x2F;www.reddit.com&#x2F;r&#x2F;CainsJawbone&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.reddit.com&#x2F;r&#x2F;CainsJawbone&#x2F;</a><p>(You can even find a digital version there, but it&#x27;s not clear if clues have been lost in the digitalisation process).
评论 #29982895 未加载
mmettlerover 3 years ago
Anyone know a place to buy a copy of the puzzle, either from Unbound or elsewhere?
评论 #29973269 未加载
评论 #29972997 未加载
MarcScottover 3 years ago
Slightly off topic, but if you get a chance then John Finnemore&#x27;s radio work is amazing. Have a look for Cabin Pressure, John Finnemore&#x27;s Souvenir Programme and Double Acts. He is a very talented comedian and story teller, and apparently somewhat of a polymath.
评论 #29976896 未加载
tunesmithover 3 years ago
Well, that was an easy impulse buy. I ordered it from Amazon to be delivered in a couple of weeks.
评论 #29974971 未加载
JetAloneover 3 years ago
I&#x27;ve never heard of this book before! That&#x27;s such a cool idea, to have the pages out of order.
jdkeeover 3 years ago
100! page ordering combinations is roughly 10^157 possibilities.
评论 #29973224 未加载
评论 #29973013 未加载
评论 #29972955 未加载
评论 #29975635 未加载
评论 #29972931 未加载