+ const key = this.canonize(word);
+ word_map[key] = word;
+ }
+ }
+
+ this.state.ambiguities = Object.values(word_map).sort((a,b) => {
+ return a.toLowerCase().localeCompare(b.toLowerCase());
+ });
+
+ this.broadcast_event_object('ambiguities', this.state.ambiguities);
+ }
+
+ receive_judged(prompt_id, session_id, word_groups) {
+ const player = this.players_by_session[session_id];
+ if (! player)
+ return { valid: false, message: "Player not found" };
+
+ const prompt = this.state.prompts.find(p => p.id === prompt_id);
+ if (! prompt)
+ return { valid: false, message: "Prompt not found" };
+
+ if (prompt !== this.state.active_prompt)
+ return { valid: false, message: "Prompt no longer active" };
+
+ /* Each player submits some number of groups of answers that
+ * should be considered equivalent. The server expands that into
+ * the set of pair-wise equivalencies that are expressed. The
+ * reason for that is so that the server can determine which
+ * pair-wise equivalencies have majority support.
+ */
+ for (let group of word_groups) {
+
+ for (let i = 0; i < group.length - 1; i++) {
+ for (let j = i + 1; j < group.length; j++) {
+ let eq = [group[i], group[j]];
+
+ /* Put the two words into a reliable order so that we don't
+ * miss a pair of equivalent equivalencies just because they
+ * happen to be in the opposite order. */
+ if (eq[0].localeCompare(eq[1]) > 0) {
+ eq = [group[j], group[i]];
+ }
+
+ const key=`${this.canonize(eq[0])}:${this.canonize(eq[1])}`;
+
+ const exist = this.equivalencies[key];
+ if (exist) {
+ exist.count++;
+ } else {
+ this.equivalencies[key] = {
+ count: 1,
+ words: eq
+ };
+ }
+
+ }
+ }
+ }
+
+ /* Update state (to be sent out to any future clients) */
+ this.state.players_judging.delete(player.name);
+ this.state.players_judged.push(player.name);
+
+ /* And notify all players this this player has judged. */
+ this.broadcast_event_object('player-judged', player.name);
+
+ return { valid: true };
+ }
+
+ receive_judging(prompt_id, session_id) {
+ const player = this.players_by_session[session_id];
+ if (! player)
+ return { valid: false, message: "Player not found" };
+
+ const prompt = this.state.prompts.find(p => p.id === prompt_id);
+ if (! prompt)
+ return { valid: false, message: "Prompt not found" };
+
+ if (prompt !== this.state.active_prompt)
+ return { valid: false, message: "Prompt no longer active" };
+
+ /* Notify all players this this player is actively judging. */
+ this.state.players_judging.add(player.name);
+ this.broadcast_event_object('player-judging', player.name);
+
+ return { valid: true };
+ }
+
+ /* Returns true if vote toggled, false for player or prompt not found */
+ toggle_end_judging(prompt_id, session_id) {
+ const player = this.players_by_session[session_id];
+
+ const prompt = this.state.prompts.find(p => p.id === prompt_id);
+ if (! prompt || ! player)
+ return false;
+
+ if (this.state.end_judging.has(player.name)) {
+ this.state.end_judging.delete(player.name);
+ this.broadcast_event_object('unvote-end-judging', player.name);
+ } else {
+ this.state.end_judging.add(player.name);
+ this.broadcast_event_object('vote-end-judging', player.name);
+ }
+
+ return true;
+ }
+
+ canonize(word) {
+ return word.trim().toLowerCase();
+ }
+
+ compute_scores() {
+ const word_submitters = {};
+
+ /* Perform a (non-strict) majority ruling on equivalencies,
+ * dropping all that didn't get enough votes. */
+ const quorum = Math.floor((this.players.length + 1)/2);
+ const agreed_equivalencies = Object.values(this.equivalencies).filter(
+ eq => eq.count >= quorum);
+
+ /* And with that agreed set of equivalencies, construct the full
+ * groups. */
+ const word_maps = {};
+
+ for (let e of agreed_equivalencies) {
+ const word0_canon = this.canonize(e.words[0]);
+ const word1_canon = this.canonize(e.words[1]);
+ let group = word_maps[word0_canon];
+ if (! group)
+ group = word_maps[word1_canon];
+ if (! group)
+ group = { words: [], players: new Set()};
+
+ if (! word_maps[word0_canon]) {
+ word_maps[word0_canon] = group;
+ group.words.push(e.words[0]);
+ }
+
+ if (! word_maps[word1_canon]) {
+ word_maps[word1_canon] = group;
+ group.words.push(e.words[1]);