anchor.diff:          copyOfAllCharms.shuffle(rand);
           charms.add(copyOfAllCharms.first);
           //TODO though they can also vaccilate, once i implement that
  -
  +    }
  +
  +    void setCharmsHuman() {
  +        print("going to set human charms");
  +        if(charms != null) charms.clear(); //out with the old, make sure to always sync to dolls.
  +        List<Charm> copyOfAllCharms = Charm.allHuman;
  +        Random rand = new Random(seed);
  +        copyOfAllCharms.shuffle(rand);
  +        charms.add(copyOfAllCharms.first);
       }
   
   }
positive.code: it also has two or more dolls as participants, which it uses to seed its random (addative)
   */
  class Trove {
      //only the first two will be named
      List<Participant> participants = new List<Participant>();
      List<Charm> charms = new List<Charm>();
  
negative.code:         }
          ret = Math.min(ret, copyOfAllCharms.length); //don't be bigger than list
          charms = copyOfAllCharms.sublist(0,ret);
      }
  
      void setCharmsGloriousBullshit() {
          print("going to set gb charms");
          if(charms != null) charms.clear(); //out with the old, make sure to always sync to dolls.
          List<Charm> copyOfAllCharms = Charm.allGloriousBullshit;
          Random rand = new Random(seed);
          copyOfAllCharms.shuffle(rand);
          int ret = 1;
          //lower numbers are most common
          for(int i = 0; i <13; i++) {
              if(rand.nextDouble() < .5) {
                  ret++;
              }else {
                  break; //pl has taught me dangerous things
              }
          }
          ret = Math.min(ret, copyOfAllCharms.length); //don't be bigger than list
          charms = copyOfAllCharms.sublist(0,ret);
      }
  
      void setCharmsTroll() {
  