31:[] 2f:{"title":"Find a Big Word in a Directed Graph","cells":[{"id":0,"value":"# Find a Big Word in a Directed Graph\n\n* The graph below forms a big word.\n* An arrow connects the first letter to the second. The second letter has an arrow to the third, and so on.\n* Each arrow is used exactly once.\n* There is no winning or losing. The objective is to find big words.","pinned":false,"hidden":false,"mode":"md"},{"id":16,"value":"dot`digraph {\nrankdir = LR;\n${goodGuessNodes.map(x => x + '[color = \"'+ goodGuessColor + '\"]').join(';\\n')}\n${goodGuessLinks.map(x => x[0] + '->' + x[1] + '[color = \"' + goodGuessColor + '\"]').join(';\\n')}\n${remainingLinks.map(x => x[0] + '->' + x[1]).join(';\\n')}\n${badGuessNodes.map(x => x + '[color = \"'+ badGuessColor + '\"]').join(';\\n')}\n${badGuessLinks.map(x => x[0] + '->' + x[1] + '[color = \"' + badGuessColor + '\"]').join(';\\n')}\n}`","pinned":false,"hidden":false,"mode":"ojs"},{"id":60,"value":"guess = {\n const input = html``\n const button = html``\n const submit = function(event) {\n // keycode === 13 for \"Enter\" key\n if (event.keyCode === 13) {\n event.preventDefault();\n \n handleEnter(input.value)\n input.value = \"\"\n }\n}\n const buttonSubmit = function(event) { \n handleEnter(input.value)\n input.value = \"\"\n} \n \n input.addEventListener(\"keyup\", submit)\n button.addEventListener(\"click\", buttonSubmit)\n\n return html`\n ${input}\n ${button}\n `\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":205,"value":"viewof wordLengthBounds = rangeSlider({\n min: 5,\n max: 20,\n // Note that values must be specified as array of length 2.\n value: [8, 15],\n // Custom slider CSS, replaces all styles.\n // Overrides the range color. Support for range colors is up to the theme.\n title: 'Min and Max of Possible Word Length',\n description: 'Shorter words tend to be easier to find',\n precision: 0\n})","pinned":false,"hidden":false,"mode":"ojs"},{"id":215,"value":"viewof minRepeatedLetters = Inputs.range([0, 8], {label: \"Min # Repeated Letters\", step: 1, value: 4})","pinned":false,"hidden":false,"mode":"ojs"},{"id":433,"value":"htl.html `\n\n \n \n \n\n${history.map((x,i) => drawRecord(x))}\n

guess	answer	letters

`","pinned":false,"hidden":false,"mode":"ojs"},{"id":148,"value":"viewof badGuessColor = Inputs.color({value: \"#bb0000\"})","pinned":true,"hidden":false,"mode":"ojs"},{"id":314,"value":"viewof goodGuessColor = Inputs.color({value: \"#16a716\"})","pinned":true,"hidden":false,"mode":"ojs"},{"id":250,"value":"focus = {\n //feels like there's a better way to do this\n guess;\n document.getElementById('guess').focus()\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":432,"value":"drawRecord = (x) => {\n return htl.html.fragment `\n ${x.guess}\n ${x.currentWord}\n ${x.currentWord.length}\n\n`\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":74,"value":"guessValue = {\n while(true){\n try {yield document.getElementById('guess').value.toUpperCase()}\n catch {yield Promises.delay(100)}\n }\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":7,"value":"currentLinks = {\n const links = []\n for (let i = 1; i < currentWord.length; ++i) {\n links.push([currentWord[i-1],currentWord[i]])\n }\n \n return links\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":136,"value":"guessLinks = {\n const links = []\n for (let i = 1; i < guessValue.length; ++i) {\n links.push([guessValue[i-1],guessValue[i]])\n }\n \n return links\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":326,"value":"goodGuessLinks = {\n const current = _.countBy(currentLinks.map(x => x[0] + x[1]))\n const guess = _.countBy(guessLinks.map(x => x[0] + x[1]))\n const guessKeys = Object.keys(guess)\n const out = []\n\n for (const key of guessKeys) {\n for (let i = 0; i < Math.min(guess[key], current[key]); i++) {\n out.push(key)\n }\n }\n return out.map(x => [x[0], x[1]])\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":172,"value":"remainingLinks = {\n const current = currentLinks.map(x => x[0] + x[1])\n const currentDistinct = _.uniq(current)\n\n const guess = guessLinks.map(x => x[0] + x[1])\n const remaining = []\n for (let i = 0; i < currentDistinct.length; ++i) {\n // get the number of times element appears in current\n const occurencesInCurrent = current.filter(x => x === currentDistinct[i]).length\n // get number of time element appears in guess\n const occurencesInGuess = guess.filter(x => x === currentDistinct[i]).length\n // append difference\n const occurencesInRemaining = occurencesInCurrent - occurencesInGuess\n for (let j = 0; j < occurencesInRemaining; j++) remaining.push(currentDistinct[i])\n }\n return remaining.map(x => [x[0], x[1]])\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":322,"value":"badGuessLinks = {\n const current = _.countBy(currentLinks.map(x => x[0] + x[1]))\n const guess = _.countBy(guessLinks.map(x => x[0] + x[1]))\n const guessKeys = Object.keys(guess)\n const out = []\n\n for (const key of guessKeys) {\n for (let i = 0; i < guess[key] - (current[key] ? current[key] : 0); i++) {\n out.push(key)\n }\n }\n return out.map(x => [x[0], x[1]])\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":81,"value":"currentNodes = [... new Set(currentWord.split(''))]","pinned":true,"hidden":false,"mode":"ojs"},{"id":131,"value":"guessNodes = [... new Set(guessValue.split(''))]","pinned":true,"hidden":false,"mode":"ojs"},{"id":334,"value":"goodGuessNodes = _.intersection(guessNodes, currentNodes)","pinned":true,"hidden":false,"mode":"ojs"},{"id":336,"value":"badGuessNodes = _.difference(guessNodes, currentNodes)","pinned":true,"hidden":false,"mode":"ojs"},{"id":62,"value":"handleEnter = (guess) => {\n const isGoodGuess = guess.toUpperCase() === currentWord\n const points = isGoodGuess ? 1 : 0\n\n let scoreAfter = score + points\n mutable score = scoreAfter\n \n const ts = new Date()\n log({guess: guess.toUpperCase(), currentWord, isGoodGuess, points})\n \n mutable currentWord = pickWord2(wordLengthBounds[0], wordLengthBounds[1], minRepeatedLetters)\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":270,"value":"pickWord2 = (min, max, minRepeat) => {\n let word = pickWord(min, max)\n let i = 0\n while (word.length - _.uniq(word.split('')).length < minRepeat && i < 3000) {\n word = pickWord(min, max)\n i++\n }\n return word\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":112,"value":"mutable currentWord = pickWord2(wordLengthBounds[0], wordLengthBounds[1], minRepeatedLetters)","pinned":true,"hidden":false,"mode":"ojs"},{"id":117,"value":"mutable history = []","pinned":true,"hidden":false,"mode":"ojs"},{"id":464,"value":"mutable score = 0","pinned":true,"hidden":false,"mode":"ojs"},{"id":119,"value":"log = (data) => {\n mutable history = [data, ...history]\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":49,"value":"import {pickWord} from '@a-lexwein/find-a-big-word-boggle-like'","pinned":true,"hidden":false,"mode":"ojs"},{"id":207,"value":"import {rangeSlider} from '@mootari/range-slider@1312'","pinned":true,"hidden":false,"mode":"ojs"}],"files":"$W31","stdlib":"1","titling":"auto"}