{"id":24166,"date":"2022-03-07T21:25:22","date_gmt":"2022-03-08T02:25:22","guid":{"rendered":"http:\/\/blog.kenperlin.com\/?p=24166"},"modified":"2022-03-07T21:25:22","modified_gmt":"2022-03-08T02:25:22","slug":"spelling-bee","status":"publish","type":"post","link":"http:\/\/blog.kenperlin.com\/?p=24166","title":{"rendered":"Spelling Bee"},"content":{"rendered":"

I’ve been doing the New York Times Spelling Bee<\/a>. It’s a daily puzzle and it’s lots of fun.<\/p>\n

Sometimes I manage to find all possible words. But that’s only on a good day.<\/p>\n

The rules are always the same, but each day they change the configuration of letters. The result is that some days are fairly easy, and others are killer hard.<\/p>\n

Based on the initial configuration of letters, every day has a particular maximum possible score. Which leads my mind to the following different puzzle:<\/p>\n

Given the rules of Spelling Bee, what configuration of letters would produce the highest possible score?<\/p>\n

It seems to me that this might be a challenging problem. My inclination would be to write a computer program to search through likely solutions.<\/p>\n

But a likely solution is not a proof. A really interesting open challenge might be to prove<\/i> that a particular configuration of letters produces the maximum possible score.<\/p>\n

And that problem might be hard.<\/p>\n","protected":false},"excerpt":{"rendered":"

I’ve been doing the New York Times Spelling Bee. It’s a daily puzzle and it’s lots of fun. Sometimes I manage to find all possible words. But that’s only on a good day. The rules are always the same, but each day they change the configuration of letters. The result is that some days are … Continue reading “Spelling Bee”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"_links":{"self":[{"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/posts\/24166"}],"collection":[{"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=24166"}],"version-history":[{"count":1,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/posts\/24166\/revisions"}],"predecessor-version":[{"id":24167,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/posts\/24166\/revisions\/24167"}],"wp:attachment":[{"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=24166"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=24166"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=24166"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}