anchor.diff:  
   === Deadlock
   These definitions allow us to specify the problem more precisely.
  -We start by assuming a SimpleVote algorithm that compares Preferences and chooses the most popular:
  +We start by assuming a https://radicalcentrism.org/resources/maximum-majority-voting[SimpleVote] algorithm that compares Preferences and chooses the most popular:
   ```
   ; SimpleVote([
     [.A,.B,],
  
positive.code: ; SimpleVote(Deadlock)
  # ()
  ```
  There is no fair algorithm that can decide which Game to play using these input "cycles;"
  a result known as Arrow's Impossibility Theorem or the Condorcet Paradox.
  Under the terms of our scenario, we have a crisis.
  These four Ents have all invested time and energy to come to the Club.
  If there is no Game, that energy will be wasted.
  Worse, the Ents may rationally decide to stop coming, and the Club will dissolve.
  Can anything be done?
  
  We posit a new BossVote algorithm that takes Energy from one Ent to establish their vote as the "default" choice, to ensure that the Club can always decide on a Game to play
  ```
  ; .Boss Club.0 # Choose member 0 of the Club as Boss
  ; BossVote(Boss, Deadlock) # Re-run the vote using energy from that Boss
  
negative.code:    0,
  ]
  
  .MartyrBoss_Game [
    [.E -11, (.I -1, .C 10)],
    [.E -5,  (.I  1, .C 10)],
    [.E -5,  (.I  2, .C 10)],
  