anchor.diff:      return ret;
   
     }
  -  /*
  -  int longestRoute(Territory territory, List<Territory> list, int max) {
  -    int ret = max;
  -    int temp;
  -    territory.neighbours.values.forEach((f) {
  -      if (territory.owner == f.owner && !list.contains(f)) {
  -        List<Territory> out = new List<Territory>();
  -        //list.add(f);
  -        out.addAll(list);
  -        out.add(territory);
  -        temp = longestRoute(f, list, max + 1);
  -        if (temp > ret) ret = temp;
  -      }
  -    });
  -   
  -    return ret;
  -  }*/
   }
   
   class Ai_agg extends Player {
  
positive.code:     this.tiles = new List<String>();
      this.neighbourTiles = new Map<String, Tile>();
      this.neighbours = new Map<String, Territory>();
      dies = 2;
    }
    List<List<int>> attackTerritory(Territory ter) {
      List<List<int>> ret = new List();
  
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);
  