30:T996,{ const { height, width, margins: { top, left, bottom, right } } = options, // At first, just create the basic SVG div = d3.create("div").attr("id", "board"), // sel = d3 // .create("svg") // .attr("id", "board") sel = div.append("svg").attr("width", width).attr("height", height), container = sel.append("g").attr("id", "container"); const xScale = d3 .scaleBand() .domain([0, 1, 2, 3, 4]) .range([right, width - left]) .paddingInner(0.1); console.log(xScale(0), xScale(1)); sel.attr("style", (d) => settings.indexOf("board") >= 0 ? `transform: rotateZ(-90deg) rotateY(${ Math.floor(Math.random() * 20) + 40 }deg) rotateZ(${Math.floor( Math.random() * 360 )}deg); perspective: 800px;` : `` ); const rows = container .selectAll(".die") .data(grid) .join( (enter) => enter .append("g") .attr("class", "row") .attr("transform", (d, i) => `translate(${xScale(i)}, 0)`), (update) => update, (exit) => exit.remove() ); const dice = rows .selectAll(".die") .data((d) => d) .join((enter) => { const die = enter .append("g") .classed("die", true) .attr("transform", (d, i) => `translate(0, ${xScale(i)})`); die .append("rect") .attr("width", xScale.bandwidth()) .attr("height", xScale.bandwidth()) .attr("rx", 5) .attr("fill", "#ccc"); die .append("circle") .attr("cx", xScale.bandwidth() / 2) .attr("cy", xScale.bandwidth() / 2) .attr("r", (xScale.bandwidth() / 2) * 0.9) .attr("fill", "#eee"); die .append("text") .text((d) => d) .attr("x", xScale.bandwidth() / 2) .attr("y", xScale.bandwidth() / 2) // .attr("visibility", () => {console.log(timer);return timer.running?"visible":"hidden"}) .attr("dominant-baseline", "middle") .attr("text-anchor", "middle") .attr("font-weight", "bold") .attr("fill", "#fff") .attr("dy", 2) .attr("transform", (d) => settings.indexOf("letters") >= 0 ? `rotate(${Math.floor(Math.random() * 4) * 90} ${ xScale.bandwidth() / 2 } ${xScale.bandwidth() / 2})` : `` ); return die; }); return div.node(); }31:T667,graph = { //split grid into 2D array // const rows = input.trim().split("\n").map(s => s.trim().split("")); const rows = grid console.log(rows) const nodes = {}; const edges = {}; //return letter at x,y function getId(y, x) { return `${x},${y},${rows[y][x].toLowerCase()}`; } function addEdge(sourceId, y, x) { // tolerate wonky grids with holes or uneven numbers of rows for now if (rows[y][x]) { const targetId = getId(y, x); edges[sourceId].push(targetId); } } //create nodes for each letter //create edges for each adjacent letter to each node for (let y = 0; y < rows.length; y ++) { const row = rows[y]; for (let x = 0; x < row.length; x ++) { const value = row[x].toLowerCase(); const id = getId(y, x); nodes[id] = value; if (!edges[id]) { edges[id] = []; } if (x > 0) { // left addEdge(id, y, x - 1); if (y > 0) { // up left addEdge(id, y - 1, x - 1); } if (y < rows.length - 1) { // down left addEdge(id, y + 1, x - 1); } } if (x < row.length - 1) { // right addEdge(id, y, x + 1); if (y > 0) { // up right addEdge(id, y - 1, x + 1); } if (y < rows.length - 1) { // down right addEdge(id, y + 1, x + 1); } } if (y > 0) { // up addEdge(id, y - 1, x); } if (y < rows.length - 1) { // down addEdge(id, y + 1, x) } } } return { nodes, edges }; }32:T46e,result = { const { nodes, edges } = graph; let words = new Set(); console.log("nodes",nodes) console.log("edges",edges) function visit(id, idStack, letterStack) { //stop if we've visited this letter already if (idStack.includes(id)) { return; }; //record this node as visited, record the letter idStack.push(id); letterStack.push(nodes[id]); //if at least MIN_LENGTH letters long, and the word so far exists in `t` the Trie, add the word if (letterStack.length >= MIN_LENGTH && t.hasWord(letterStack)) { words.add(letterStack.join("")); } //if the letters collected so far are in the Trie, then visit all the node's neighbors via its edges if (t.hasPrefix(letterStack)) { edges[id].forEach(neighbourId => { visit(neighbourId, idStack, letterStack); }) } idStack.pop(); letterStack.pop(); } const idStack = []; const letterStack = []; Object.keys(nodes).forEach(id => { visit(id, idStack, letterStack); }) return [...words].sort((a, b) => b.length - a.length || a.charCodeAt(0) - b.charCodeAt(0)); }33:T540,function trie() { const root = {}; const isWord = Symbol("isWord"); return { //split added word into array of single`chars` add([...chars]) { //Boggle doesn't have a single "Q" tile, it has a combined "Qu" tile. //combine any consecutive Q,U letters into a single "char" let node = root; while (chars.length > 0) { let c = chars.shift(); //if c == 'Q', then check if next letter is U if (c =='q' && chars[0] == 'u' ) { c += chars.shift() } if (!node[c]) { node[c] = chars.length === 0 ? { [isWord]: true } : {}; } node = node[c]; } return root; }, hasWord([...chars]) { let node = root; let c; while (chars.length > 0) { //get first letter of word c = chars.shift(); if (!node.hasOwnProperty(c)) { return false; } node = node[c]; } return node.hasOwnProperty(isWord); }, hasPrefix([...chars]) { let node = root; while (chars.length > 0) { const c = chars.shift(); if (!node.hasOwnProperty(c)) { return false; } node = node[c]; } return Object.keys(node).length > 0; }, root } }34:[] 2e:{"title":"Big Boggle","cells":[{"id":0,"value":"md`# Big Boggle`","pinned":false,"hidden":false,"mode":"ojs"},{"id":525,"value":"Todo:\n- allow rotating the board\n- tap letters to type a word, and add to your list\n- timer to limit how long player has to find words\n","pinned":false,"hidden":false,"mode":"md"},{"id":526,"value":"viewof settings = Inputs.checkbox(\n new Map([\n [\"Rotate Letters\", \"letters\"],\n [\"Rotate Board\", \"board\"]\n ]),\n {\n label: \"Settings\",\n format: ([name, value]) => name,\n value: [\"letters\", \"board\"]\n }\n)","pinned":false,"hidden":false,"mode":"ojs"},{"id":431,"value":"viewof shake = Inputs.button(\"Shake\")","pinned":false,"hidden":false,"mode":"ojs"},{"id":438,"value":"$30","pinned":false,"hidden":false,"mode":"ojs"},{"id":561,"value":"viewof MIN_LENGTH = Inputs.range([3, 6], {\n label: \"Shortest Word Length\",\n step: 1,\n value: 3\n})","pinned":false,"hidden":false,"mode":"ojs"},{"id":8,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"},{"id":139,"value":"test = t.hasPrefix(\"arse\")","pinned":false,"hidden":false,"mode":"ojs"},{"id":49,"value":"$32","pinned":false,"hidden":false,"mode":"ojs"},{"id":79,"value":"words = {\n // 480k words: too much noise\n //const url = \"https://raw.githubusercontent.com/dwyl/english-words/master/words.txt\";\n \n // 235k words: still too much noise\n // \"https://raw.githubusercontent.com/dolph/dictionary/master/unix-words\"\n \n // most common 20k words: contains many real nouns\n // const url = \"https://raw.githubusercontent.com/first20hours/google-10000-english/master/20k.txt\"\n \n // Wiktionary's top 23k words: nice!\n const url = \"https://raw.githubusercontent.com/dolph/dictionary/master/popular.txt\";\n return (await d3.text(url)).split(\"\\n\").map(w => w.trim().toLowerCase());\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":7,"value":"$33","pinned":false,"hidden":false,"mode":"ojs"},{"id":204,"value":"score = (words) => words.reduce((sum, word) => sum + word.length - (MIN_LENGTH - 1), 0)","pinned":false,"hidden":false,"mode":"ojs"},{"id":21,"value":"t = {\n const t = trie()\n console.log(\"starting...\");\n for (let i = 0; i < words.length; i ++) {\n t.add(words[i]); \n }\n console.log(\"done!\");\n return t;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":252,"value":"md`\n${/* TODO: can I embed a `viewof` textarea here? */\"\"}\n### I found __${result.length}__ words, scoring __${score(result)}__:\n\n

${result.map(w => `${w} (${(score([w]))})`).join(\"\\n\")}

\n\nThe dictionary had ${words.length} words.\n\n\n### TODO:\n* UI\n* Generate input from cube distribution\n`","pinned":false,"hidden":false,"mode":"ojs"},{"id":283,"value":"trie","pinned":true,"hidden":false,"mode":"ojs"},{"id":291,"value":"foo = function ([...chars]) {\n return chars\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":294,"value":"{\n const bar = foo(\"hello\")\n let baz = bar.shift()\n baz+= bar.shift() \n return bar\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":307,"value":"//Official letters from the Big Boggle dice \nletters5x5 = [\n [\"Qu\", \"B\", \"Z\", \"J\", \"X\",\"K\"],\n [\"T\", \"O\", \"U\", \"O\", \"T\", \"O\"],\n [\"O\", \"V\", \"W\", \"R\", \"G\", \"R\"],\n [\"A\", \"A\", \"A\", \"F\", \"S\", \"R\"],\n [\"A\", \"U\", \"M\", \"E\", \"E\", \"G\"],\n [\"H\", \"H\", \"L\", \"R\", \"D\", \"O\"],\n [\"N\", \"H\", \"D\", \"T\", \"H\", \"O\"],\n [\"L\", \"H\", \"N\", \"R\", \"O\", \"D\"],\n [\"A\", \"F\", \"A\", \"I\", \"S\", \"R\"],\n [\"Y\", \"I\", \"F\", \"A\", \"S\", \"R\"],\n [\"T\", \"E\", \"L\", \"P\", \"C\", \"I\"],\n [\"S\", \"S\", \"N\", \"S\", \"E\", \"U\"],\n [\"R\", \"I\", \"Y\", \"P\", \"R\", \"H\"],\n [\"D\", \"O\", \"R\", \"D\", \"L\", \"N\"],\n [\"C\", \"C\", \"W\", \"N\", \"S\", \"T\"],\n [\"T\", \"T\", \"O\", \"T\", \"E\", \"M\"],\n [\"S\", \"C\", \"T\", \"I\", \"E\", \"P\"],\n [\"E\", \"A\", \"N\", \"D\", \"N\", \"N\"],\n [\"M\", \"N\", \"N\", \"E\", \"A\", \"G\"],\n [\"U\", \"O\", \"T\", \"O\", \"W\", \"N\"],\n [\"A\", \"E\", \"A\", \"E\", \"E\", \"E\"],\n [\"Y\", \"I\", \"F\", \"P\", \"S\", \"R\"],\n [\"E\", \"E\", \"E\", \"E\", \"M\", \"A\"],\n [\"I\", \"T\", \"I\", \"T\", \"I\", \"E\"],\n [\"E\", \"T\", \"I\", \"L\", \"I\", \"C\"]\n]\n","pinned":true,"hidden":false,"mode":"ojs"},{"id":311,"value":"{\n return [\"a\",\"b\",\"c\",\"d\",\"e\"].reduce(shuffle, [\"a\",\"b\",\"c\",\"d\",\"e\"])\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":361,"value":"letters5x5.reduce(shuffle, letters5x5)\n","pinned":true,"hidden":false,"mode":"ojs"},{"id":349,"value":"shuffle = function(acc, cur, i, array) {\n const arr = [...acc]\n const j = (Math.floor(Math.random() * (array.length - i)) + i)\n\n const t = [...arr[i]]\n arr[i] = [...arr[j]]\n arr[j] = t\n console.log(acc, arr)\n\n return arr\n \n }","pinned":true,"hidden":false,"mode":"ojs"},{"id":365,"value":"shuffleIndex = function(array) {\n const arr = [...array]\n for (let i = array.length - 1; i > 0; i--) {\n const j = Math.floor(Math.random() * (i + 1));\n const temp = array[i];\n array[i] = array[j];\n array[j] = temp;\n }\n\n return arr\n \n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":367,"value":"board = {\n shake;\n return shuffleIndex(letters5x5).map(\n (cube) => cube[Math.floor(Math.random() * 6)]\n );\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":372,"value":"grid = {\n \n const grid = [], b = [...board]\n console.log([...b], b, board)\n for (let i = 0; i<5; i++) {\n const row = b.splice(0,5)\n console.log(row)\n grid.push(row)\n }\n return grid\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":453,"value":"","pinned":false,"hidden":false,"mode":"html"},{"id":442,"value":"options = ({\n height: 375 / 1.717,\n width: 375 / 1.717,\n margins: {\n top: 10,\n right: 10,\n bottom: 10,\n left: 10\n }\n})","pinned":false,"hidden":false,"mode":"ojs"}],"files":"$W34","stdlib":"1","titling":"auto"}