src/GeneticCode.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 "GeneticCode.h"

#include <iostream>

using namespace std;

#include "Random.h"
#include "Constants.h"

GeneticCode::GeneticCode() {
  //Zero initialization
  _code.value = 0;

  //For all bits
  for(int n = 0; n < NB_BITS_GENETICCODE; n++){

    //If the randomized number is odd, we put a 1 instead of the initial 0
    if(Random::value() & 1){
      _code.value |= (1 << n);
    }
  }

  if(_code.bitfield.size > MAX_WORSHIPER_SIZE)
    _code.bitfield.size = MAX_WORSHIPER_SIZE;
}


GeneticCode::GeneticCode(GeneticCode const * c) : _code(c->_code) {}


GeneticCode::~GeneticCode() {}


GeneticCode * GeneticCode::mutate() const{
  GeneticCode * new_code = new GeneticCode(this);

  //Generate a number between 0 and the number of bits of the structure
  int n = Random::value() % NB_BITS_GENETICCODE;

  //Flip the nth bit of the code
  if((_code.value >> n) & 1){
    new_code->_code.value &= ~(1 << n);//1 -> 0
  } else {
    new_code->_code.value |= (1 << n);//0 -> 1
  }

  return new_code;
}


GeneticCode * GeneticCode::crossover(GeneticCode * c) const{
  //Copy the current code into the new one
  GeneticCode * new_code = new GeneticCode(this);

  //For each bit of the new code, either we keep it, either we take the
  //corresponding bit of c (crossover operation)
  for(int n = 0; n < NB_BITS_GENETICCODE; n++){

    //Generate a number. If it is odd, we take the corresponding bit of c : c[n]
    if(Random::value() & 1){
      if((c->_code.value >> n) & 1){ //If c[n] == 1, then new_code[c] = 1
        new_code->_code.value |= (1 << n);
      } else { //If c[n] == 0, then new_code[c] = 0
        new_code->_code.value &= ~(1 << n);
      }
    } //else, we keep that bit

  }

  return new_code;
}


void GeneticCode::print(){
  int bit;
  cout << "######### GeneticCode::print() ##########" << endl;
  for(int n = 0; n < NB_BITS_GENETICCODE; n++){
    bit = ((_code.value << n) >> (NB_BITS_GENETICCODE - 1)) & 1;
    cout << bit << " ";
  }
  cout << "= " << _code.value <<  endl;
  cout << "######### end GeneticCode::print() ##########" << endl;
}

---