anchor.diff:      for (int i = 0; i < territories.length; i++) {
         if (territories[i].dies > 2) {
           territories[i].neighbours.values.forEach((f) {
  -          if (territories[i].owner != f.owner) {
  +          if (territories[i].ownerRef.id  != f.ownerRef.id&& f.ownerRef.id !="whitefield" ) {
               if (territories[i].dies > f.dies + 1 || territories[i].dies == 8) {
                 list.add(territories[i]);
                             list.add(f);
  
positive.code:    */
    Player(this.id) {
      territories = new List<Territory>();
    }
    List<Territory> turn();
    void resupply() {
      int max = 1;
      int temp = 1;
      for (int i = 0; i < territories.length; i++) {
        List<Territory> list = new List<Territory>();
       // list.add(territories[i]);
        temp = longestRoute(territories[i], list, this.id);
        if (temp > max) max = temp;
      }
      print("Resupplying with $max dies.");
      var _random = new Math.Random();
      for (int i = 0; i < max; i++) {
        if (territories.length > 0) {
          territories[_random.nextInt(territories.length - 1)].dies++;
        }
      }
    }
  
negative.code:     for (int i = 0; i < territories.length; i++) {
        if (territories[i].dies > 2) {
          territories[i].neighbours.values.forEach((f) {
            if (territories[i].ownerRef.id  != f.ownerRef.id&& f.ownerRef.id !="whitefield" ) {
              if (territories[i].dies > f.dies + 1 || territories[i].dies == 8) {
                list.add(territories[i]);
                            list.add(f);
  