src/GeneticBehaviour.cpp

Go to the documentation of this file.

/*
This file is part of Teapot Colony Wars.

Teapot Colony Wars is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.

Teapot Colony Wars is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with Teapot Colony Wars.  If not, see <http://www.gnu.org/licenses/>.
*/

#include "GeneticBehaviour.h"

#include <map>

#include "Random.h"
#include "VisualContext.h"
#include "GeneticCode.h"
#include "MoveIterator.h"
#include "WorshiperInfo.h"

#define NOT_HUNGRY_FACTOR   0.5

#define BONUS_GREEDY        10

#define MALUS_ANOREXIC      (-10)

#define MALUS_NOT_HUNGRY    (-10)

#define BONUS_AGGRESSIVE    15

#define MALUS_COWARD        (-15)

#define MALUS_REASONABLE    (-10)

#define INFINITE            1000;


using namespace std;

GeneticBehaviour::GeneticBehaviour() : Behaviour(),
                                       _code(new GeneticCode) {}


GeneticBehaviour::GeneticBehaviour(GeneticCode * c) : Behaviour(), _code(c) {}


GeneticBehaviour::~GeneticBehaviour() {
  delete _code;
}


void GeneticBehaviour::think(){
  //Clear the pheromone list
  _pheros->clear();

  //Get the visual context
  VisualContext * visu = getVisualContext();

  //The map containing the score for each movement
  map<move_command, int> map_scores;
  map<move_command, int>::iterator it_map_scores, end_map_scores;

  //The best score and movement
  int best_score = -INFINITE;
  move_command best_move = MOVECMD_NOMOVE;

  //For ennemies
  bool found = false;
  list<WorshiperInfo> winfos;
  list<WorshiperInfo>::iterator it_winfos, end_winfos;

  //For movements
  MoveIterator it_move, end_move = visu->endMove();

  //Foreach movement, we evaluate its score
  for(it_move = visu->beginMove(); it_move != end_move; ++it_move){
    if(*it_move != MOVECMD_NOMOVE && visu->legal(it_move) && visu->reachable(it_move)){

      //Zero initialization
      map_scores[*it_move] = 0;

      //If there is food
      if(visu->haveFood(it_move)){

        //If I'm greedy (max value)
        if(_code->getGreedy() == ((1 << NB_BITS_GREEDY) - 1)){
          map_scores[*it_move] += BONUS_GREEDY;
        } else if(_code->getGreedy() == 0){ //Else if I'm anorexic
          map_scores[*it_move] += MALUS_ANOREXIC;
        } else if(getFood() > (NOT_HUNGRY_FACTOR * getCapacity())){ //If I have enough food I don't go
          map_scores[*it_move] += MALUS_NOT_HUNGRY;
        }
      }

      //If there are ennemies..
      winfos = visu->getWorshipers(it_move);
      found = false;
      if(!winfos.empty()){
        end_winfos = winfos.end();
        for(it_winfos = winfos.begin(); !found && it_winfos != end_winfos; ++it_winfos){
          found = it_winfos->isEnnemy();
        }
      }
      --it_winfos;

      if(found){

        //If I'm aggressive (max value), I want to go !
        if(_code->getAggressiveness() == ((1 << NB_BITS_AGGRESSIVENESS) - 1)){
          map_scores[*it_move] += BONUS_AGGRESSIVE;
        } else if(_code->getAggressiveness() == 0){ //I'm a coward !
          map_scores[*it_move] += MALUS_COWARD;
        }

        //If I'm reasonable and if the ennemy is taller than me, I run away !
        if(_code->getReasonable() == ((1 << NB_BITS_REASONABLE) - 1)){
          if(it_winfos->getSize() > getSize()){
            map_scores[*it_move] += MALUS_REASONABLE;
          }
        }
      }
    }
  }

  //I find the maximum value
  end_map_scores = map_scores.end();
  for(it_map_scores = map_scores.begin(); it_map_scores != end_map_scores; ++it_map_scores){
    if(it_map_scores->second > best_score){
      best_score = it_map_scores->second;
      best_move = it_map_scores->first;
    }
  }

  //And I make my decision
  _action = best_move;

}

---