2b:null 2c:["$","title",null,{"children":"social state initializer | Jasmine Otto | Observable"}] 31:T6aa,wfc = (g, verbose = false) => { let choices = states; let init = choices.map(_ => true); // initialize g.nodes().forEach(u => g.setNode(u, { obs: [...init] })); /// (if node state exists, it will be clobbered! otherwise we aren't performant.) while (true) { // Observe state with heuristic, making arbitrary decisions let [min, idx] = g.nodes().reduce( (minSeen, u) => { let el = g.node(u).obs; // examine the node for its observation state if (!el) return minSeen; let rank = el.filter(b => b).length; return rank < minSeen[0] ? [rank, u] : minSeen; }, [Infinity, null] ); if (idx !== null) { g.setNode(idx, { state: pick(choices, g.node(idx).obs) }); // source of randomness if (verbose) console.log("set node " + idx + " to " + g.node(idx).state); if (g.node(idx).state === undefined) throw new Error("contradiction at node " + idx); // TODO: backtracking } else break; // exit once all nodes have collapsed // Propagate information g.successors(idx).forEach(u => { let mask = g.node(u).obs; if (!mask) return; // can't propagate to a collapsed node if (verbose) console.log(" updating " + u + " for " + idx); // adjacency rules let update = conditions(g).map(f => f(u, g.predecessors(u), g.inEdges(u)) ); let res = mask.map((_, i) => mask[i] && update[i]); // let ban = choices.indexOf(g.node(idx)); // mask[ban] = false; // neighbors can't be the same if (verbose) console.log(" " + res); g.node(u).obs = res; // g.setNode(u, {obs: res}); }); } // g.setNode("A", "glad"); return g; }32:T5db,// https://observablehq.com/@tmcw/observable-anti-patterns-and-code-smells /* Generators.observe(notify => { let interval = setInterval(() => { if (mutable active.length > 0 || mutable inactive.length > 0) notify(propagate()); }, 500); return () => clearInterval(interval); }) */ propagate = () => { let updated = [], resolved = []; mutable active.forEach(u => { // if I was touched, touch everyone who sees me let contradiction = false; social.successors(u).forEach(v => { if (mutable inactive.includes(v)) return; // prevent 2-node oscillators let mask = conditions(social).map(f => f(v, social.predecessors(v), null) ); if (mask[states.indexOf(social.node(v).state)]) return; // don't change if you don't have to if (mask.every(b => !b)) { // contradiction! contradiction = true; let log = mutable events; log.unshift(['conflicted', v, mutable tick]); mutable events = [...log]; let choice = pick(states.filter(s => s != social.node(v).state)); // change to random state social.setNode(v, { state: choice }); } else { let choice = pick(states, mask); social.setNode(v, { state: choice }); } if (!updated.includes(v)) updated.push(v); }); if (!contradiction) resolved.push(u); // if there was a contradiction, the actor isn't resolved. }); mutable inactive = resolved; mutable active = updated; ++mutable tick; }33:T552,town = { const g = new graphlib.Graph({ directed: false }); g.setGraph({}); let link = (u, v) => { g.setEdge(u, v, { kind: 'adjacent' }); }; // simple triangle /* g.setNode("A"); g.setNode("B"); g.setNode("C"); link("A", "B"); link("A", "C"); link("B", "C"); */ [..."ABCDEFGHIJK"] .reduce((acc, u) => [...acc, `${u} ext.`, `${u} int.`], []) .forEach((u, i, arr) => { if (i % 2 == 0) { g.setNode(u, { label: u }); if (i > 1 && i % 8 != 0) link(u, arr[i - 2]); // link to next if (i > 9) link(u, arr[i - 10]); // link up rows } else { if (Math.random() < .8) { g.setNode(u, { label: u }); link(u, arr[i - 1]); // link interior to exterior } else return; } // occasionally make a shortcut to someplace we've been if (Math.random() < .2) { let v = pick(arr.slice(0, i || 1)); if (u != v && g.nodes().includes(v)) link(u, v); } }); /* let keys = [...g.nodes()] // HACK: assumes insertion order stable d3.range(5).forEach(i => { let u = Math.floor(Math.random() * i * 2); let v = Math.floor(Math.random() * i * 2); if (u != v) { link(keys[u], keys[v]); } else if (u < keys.length - 4) { link(keys[u], keys[u + 4]); } }); */ g.graph().rankDir = 'LR'; // 'UD' return g; }34:[] 2f:{"id":"c35890b7ce6b312b","slug":"social-state-initializer","title":"social state initializer","thumbnail":"e1dedf5c7795de7769a008a4e570c2418cfe776d4bcaefd53e39629da16c4e89","access_level":"public","create_time":"$D2021-04-06T02:31:23.321Z","update_time":"$D2021-04-19T07:42:01.379Z","view_time":null,"first_public_time":"$D2021-04-09T18:51:07.198Z","fork":true,"stars":1,"starred":false,"owner":{"type":"team","id":"43e035ce64fad801","login":"jazztap","name":"Jasmine Otto","avatar_url":"https://avatars-next.observableusercontent.com/1d847b962089e3524d821a011682b5ec09925cb269ab3f15456fb6e38e574bcc","tier":"starter_2024"},"version":1241,"publish_version":1241,"role":null,"authored":false,"authors":[{"type":"individual","id":"91a3f7bf83a60ddd","login":"jazztap","name":"Jasmine Otto","avatar_url":"https://avatars-next.observableusercontent.com/1d847b962089e3524d821a011682b5ec09925cb269ab3f15456fb6e38e574bcc","tier":null}],"members":[{"type":"individual","id":"91a3f7bf83a60ddd","login":"jazztap","name":"Jasmine Otto","avatar_url":"https://avatars-next.observableusercontent.com/1d847b962089e3524d821a011682b5ec09925cb269ab3f15456fb6e38e574bcc","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"subscribed":null,"forks":2,"collection":{"id":"fa0ea72c692c6c26","slug":"druid-game","title":"druid game prototypes","owner":{"id":"43e035ce64fad801","login":"jazztap","name":"Jasmine Otto"}},"type":"notebook","body":{"title":"social state initializer","cells":[{"id":0,"value":"md`# social state initializer\n\n**update 4/5/21**: smaller views, but more of them. new floodfill for betrayal plots. stylesheet colors update themselves. new location graph topology, too.\n\n**update 8/14/20**: social graph topology. colors for states in the stylesheet.\n\n**next update**: visualize a transition cascade due to changing someone's state by fiat.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":96,"value":"$31","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":620,"value":"mutable active = []","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":638,"value":"mutable inactive = []","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":321,"value":"states = ['traitor', 'enabler', 'victim', 'bystander', 'helper']","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1098,"value":"colormap = t => d3.interpolateSpectral(.1 + t * .9)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1070,"value":"{\n // swatches\n let ret = d3.select(html``);\n let colors = states.map((u, i) => colormap(i / states.length));\n\n ret\n .selectAll('rect')\n .data(colors)\n .join('rect')\n .attr('x', (d, i) => i * 60)\n .attr('y', 0)\n .attr('width', 50)\n .attr('height', 50)\n .style('fill', d => d);\n\n return ret.node();\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":561,"value":"// stylesheet for user-defined states\nhtml``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1044,"value":"conditions = db => [\n (u, vs, links) =>\n !vs.map(v => db.node(v).state).every(s => s == 'traitor') &&\n vs.map(v => db.node(v).state).some(s => s == 'victim'),\n (u, vs, links) =>\n !vs.map(v => db.node(v).state).every(s => s == 'enabler') &&\n vs.map(v => db.node(v).state).some(s => s == 'traitor'),\n (u, vs, links) =>\n !vs.map(v => db.node(v).state).every(s => s == 'victim') &&\n vs.map(v => db.node(v).state).some(s => s == 'traitor'),\n (u, vs, links) => true, // !vs.map(v => db.node(v).state).every(s => s == 'bystander'),\n (u, vs, links) =>\n !vs.map(v => db.node(v).state).every(s => s == 'helper') &&\n vs.map(v => db.node(v).state).some(s => s == 'victim')\n]","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":833,"value":"mutable tick = 0","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":619,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":738,"value":"mutable events = []","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":743,"value":"viewof perturb = {\n let ret = html``;\n /* ret.onclick = () => {\n let target = mutable focus;\n\n social.setNode(target, {\n // change the state of the focus at random\n state: pick(states.filter(s => s != social.node(target).state))\n });\n mutable active = [...mutable active, ...social.neighbors(target), target]; // flag it\n }; */\n return ret;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":876,"value":"mutable focus = \"A\"","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":87,"value":"viewof local = {\n active;\n let ret = html``;\n yield ret; // renderer fails if the node isn't attached to page\n\n // render(ret, social)\n let close = new Set(focus);\n predecessors(social, focus, 1).forEach(u => close.add(u));\n predecessors(social, focus, 2).forEach(u => close.add(u));\n social.successors(focus).forEach(u => close.add(u));\n let view = filter(social, u => close.has(u));\n\n render(ret, view);\n ret.value = view;\n yield ret;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1157,"value":"wedges(focus)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1150,"value":"triples(focus)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1146,"value":"// find triangles, ignoring directionality\ntriples = u => {\n let g = local;\n return g\n .predecessors(u)\n .map(v => {\n // v -> u, v -> w, w -> u\n let a = g.successors(v).filter(w => g.successors(w).includes(u));\n // v -> u -> w, v -> w\n let b = g.successors(v).filter(w => g.successors(u).includes(w));\n return [v, [...a, ...b]]; // return pairs [v,[...ws]]\n })\n .reduce((arr, u) => {\n // splat to pairs [v,w]\n return u[1] ? [...arr, ...u[1].map(v => [u[0], v])] : arr;\n }, []);\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1154,"value":"wedges = u => {\n let g = local;\n return g\n .predecessors(u)\n .map(v => {\n let ws = g.neighbors(v);\n return [v, ws.filter(w => w != u)];\n })\n .reduce(\n (arr, u) => (u[1] ? [...arr, ...u[1].map(v => [u[0], v])] : arr),\n []\n );\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":837,"value":"function predecessors(g, u, depth) {\n if (depth <= 0) return new Set(u);\n else {\n let ret = new Set();\n g.predecessors(u).forEach(v => {\n predecessors(g, v, depth - 1).forEach(w => {\n ret.add(w);\n });\n });\n return ret;\n }\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":841,"value":"filter = (g, f) => {\n let ret = graphlib.json.read(graphlib.json.write(g));\n g.nodes().forEach(u => {\n if (!f(u)) ret.removeNode(u);\n });\n return ret;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":464,"value":"render = (svg, db) => {\n let sel = d3.select(svg);\n sel.append(\"g\").call(new dagred3.render(), db);\n sel.attr(\"viewBox\", `0, 0, ${db.graph().width}, ${db.graph().height}`);\n // .attr(\"height\", db.graph().height + 20);\n\n // bind style hook\n let ids = db.nodes(),\n d = i => db.node(ids[i]);\n sel.selectAll('.node').attr('class', (_, i) => d(i).state + \" node\");\n\n return sel;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":590,"value":"social = {\n perturb;\n return wfc(shape, false);\n}\n// shape.setNode(\"D\", null); // to test resolution","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":94,"value":"shape = {\n const g = new graphlib.Graph();\n g.setGraph({});\n let link = (u, v) => {\n g.setEdge(u, v, { kind: 'knows' });\n g.setEdge(v, u, { kind: 'knows' });\n };\n\n // simple triangle\n /* g.setNode(\"A\");\n g.setNode(\"B\");\n g.setNode(\"C\");\n\n link(\"A\", \"B\");\n link(\"A\", \"C\");\n link(\"B\", \"C\"); */\n\n // advanced spaghetti\n [...\"ABCDE\"].forEach((u, i, arr) => {\n // FGHIJKLMNOPQRSTUVWXYZ\n g.setNode(u);\n let rando = pick(arr.slice(0, i || 1)); // pick someone we already saw\n if (u != rando) link(u, rando);\n if (Math.random() < .4) link(u, pick(arr.filter(v => v != u))); // also, pick someone at random\n });\n\n g.graph().rankDir = 'UD'; // 'LR'\n return g;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":523,"value":"md`#### spatial coincidence wip`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":995,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":30,"value":"nav = graphlib.alg.dijkstraAll(town)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1000,"value":"town","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":373,"value":"{\n let ret = html``;\n yield ret;\n\n render(ret, town);\n yield ret;\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":528,"value":"md`#### dependencies`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":110,"value":"pick = (choices, mask = choices.map(_ => true)) => {\n let res = choices.filter((_, i) => mask[i]);\n return res[Math.floor(Math.random() * res.length)];\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":77,"value":"d3 = require('d3@v5')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":2,"value":"// https://observablehq.com/@hastebrot/hello-graphlib\ngraphlib = require('https://dagrejs.github.io/project/graphlib/v2.1.2/graphlib.min.js')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":80,"value":"import { dagred3 } from \"@mbostock/hello-dagre\" // wtf, dependency hell","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":450,"value":"html // https://observablehq.com/@mbostock/hello-dagre\n``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1061,"value":"/* states = ['fine', 'stressed', 'upset']\nconditions = db => [\n // edit me - these are simple, 'I can't match any neighbor' conditions\n (reactor, kith, links) =>\n !kith.map(v => db.node(v).state).some(s => s == 'upset'),\n (reactor, kith, links) =>\n !kith.map(v => db.node(v).state).some(s => s == 'stressed'),\n (reactor, kith, links) =>\n !kith.map(v => db.node(v).state).some(s => s == 'stressed')\n] \n.fine rect { fill: #aaaaaa; }\n.stressed rect { fill: #aa8888; }\n.upset rect { fill: #aa5555; }*/","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"}],"files":"$W34","stdlib":"1","titling":"auto"}} 30:"$2f:body"