2e:null 2f:["$","title",null,{"children":"5 Letter words with consecutive repeating letters (to get better at Puzzmo's Wordbind) | Alex Wein | Observable"}] 34:Tf36,[__Note:__ Since I published this notebook, the fine folks at Puzzmo have changed the scoring rules of Wordbind. In the game's current state, these words will no longer help you get better at Wordbind.] I've become slightly obsessed with the new daily puzzle site, [Puzzmo](). The head game designer behind Puzzmo is Zach Gage, and I've been playing the crap out of his games for over a decade now. The release of a new Zach Gage game is always a treat, and Puzzmo is the most interesting, most ambitious thing from Zach so far, intended to compete with the New York Times crossword and games section. I'm loving it so far. [This feature](https://www.theverge.com/23929222/puzzmo-newspaper-games-crossword-zach-gage) in The Verge, will give you some sense of what it's all about. While most of what is on Puzzmo are new versions of Zach's classics like Spelltower and Really Bad Chess, there are two brand new games. One is a peaceful, simple game called Flipart where you rotate tetris-y pieces to cover a rectangle. But the new game that I've been most excited about is a new word game called Wordbind, which seems to be quite inspired by NYT's Spelling Bee. Wordbind is currently "experimental" and only available to paying subscribers, but will widely available hopefully pretty soon. In Wordbind, you are presented with a large word. Your goal is to use the big word to find as many 5+ letter words contained within it as you can. You can skip and repeat letters, but you have to go from left to right. Yesterday's starting word was `DESPERATELY`. It contains the obvious gimme `DESPERATE`, where all the letters are in a row, but words like `DESERT` are a little more hidden in there. And because you can repeat letters, once you find `DESERT`, you know `DESSERT` has to be there too. As I've gotten very (too?) into Wordbind, I've been trying to think of ways Being Good At Wordbind might be different from being good at other word games, especially Boggle (Boggle is the thing in the world I'm best at). The first thing I landed on was this consecutive repeating letter pattern, like going from `DESERT` to `DESSERT`. The ability to reuse a letter is definitely a difference from most word games I play (although Spelling Bee allows them too), and this ends up meaning that the percent of valid words containing the same letter twice in a row is pretty high (28 out of the 36 valid words in `DESPERATELY` follow the pattern). In addition to these words being frequent, I find them to be the most difficult to see. And after encountering `RECCE` and `TORII` show up on multiple days, I figured it was worth putting together a list. I'm using the ENABLE word list, which is used for some online Scrabble-like games. Wordbind uses a more restrictive word list, a nice affordance when you're trying to find "every" word in a day's puzzle (although it does lead to a lot of people saying "I can't believe _____ wasn't accepted as word" every day). But a lot of words below won't be accepted in Wordbind. `AALII`, for instance, is on the list below (twice!), but was not accepted on today's `SCALABILITY`. Honestly, because of their list has less bullshit words you've never heard of, the value of studying a list like this is a lot smaller than it would be in other word games. Still, you probably weren't looking for `RECCE` and `TORII`, and keeping these words top of mind, will definitely improve your Time to Ingenious. I'm [pie_charts](https://www.puzzmo.com/user/pi/pie_charts) on Puzzmo. And if you enjoy the wonderful satisfaction of finding a big word in Wordbind or Spelltower, and want to feel that way more than twice a day, I have a collection of Observable notebooks called [Find A Big Word](https://observablehq.com/collection/@a-lexwein/find-a-big-word), which includes a handful of very little games (of questionable quality) where the objective is to find a big word.35:[] 32:{"id":"19502636e540fc12","slug":"wordbind-repeaters","title":"5 Letter words with consecutive repeating letters (to get better at Puzzmo's Wordbind)","thumbnail":"5f91c6be3249aabb2a29a8c097a850879d6ce6845043134b44eb41c33f8d50f5","access_level":"public","create_time":"$D2023-11-15T19:49:11.080Z","update_time":"$D2024-01-23T04:50:02.470Z","view_time":null,"first_public_time":"$D2023-11-17T15:55:18.196Z","fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"4093387c4c9e9fa0","login":"a-lexwein","name":"Alex Wein","avatar_url":"https://avatars-next.observableusercontent.com/24e7d8a063682ac02c3dfe01ccd791dc00d5d7f9bcb16828adbcbf2faebb73a8","tier":"starter_2024"},"version":206,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"df192455c1e22a3a","login":"a-lexwein","name":"Alex Wein","avatar_url":"https://avatars-next.observableusercontent.com/24e7d8a063682ac02c3dfe01ccd791dc00d5d7f9bcb16828adbcbf2faebb73a8","tier":null}],"members":[{"type":"individual","id":"df192455c1e22a3a","login":"a-lexwein","name":"Alex Wein","avatar_url":"https://avatars-next.observableusercontent.com/24e7d8a063682ac02c3dfe01ccd791dc00d5d7f9bcb16828adbcbf2faebb73a8","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":true,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"5 Letter words with consecutive repeating letters (to get better at Puzzmo's Wordbind)","cells":[{"id":0,"value":"# ${letterCount} Letter words with consecutive repeating letters (to get better at Puzzmo's Wordbind)","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":150,"value":"$34","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":181,"value":"viewof letterCount = Inputs.range([3, 15], {label: \"Change the word length:\", step: 1, value: 5})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":145,"value":"$${list.map(letterDiv)}","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":154,"value":"## code:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":3,"value":"import {words} from '@a-lexwein/find-a-big-word'","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":6,"value":"fitsThePattern = (word) => {\n if (word.length != letterCount) return false\n\n for (let index = 0; index < word.length; ++index) {\n if (word[index] === word[index + 1]) return true\n }\n\n return false\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":119,"value":"words.filter(fitsThePattern)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":13,"value":"alphabet = 'abcdefghijklmnopqrstuvwxyz'.split('');","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":71,"value":"fitsThePatternLetter = (word, letter) => {\n if (word.length != letterCount) return false\n\n for (let index = 0; index < word.length; ++index) {\n if ((word[index] === word[index + 1]) && word[index] == letter) return true\n }\n\n return false\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":84,"value":"words.filter(x => fitsThePatternLetter(x, 'i'))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":96,"value":"list = alphabet.map(x => ({letter: x, words: words.filter(y => fitsThePatternLetter(y, x))}))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":60,"value":"letterDiv = (x) => {\n const words = x.words.join(\", \")\n const el = html`

${x.letter.toUpperCase()} - ${x.words.length} words

${words}

`\n return el\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":170,"value":"","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"}],"files":"$W35","stdlib":"1","titling":"auto"}} 33:"$32:body"