Method Task_Optimize

avida-core/source/main/cTaskLib.cc:2585–2872

}

double cTaskLib::Task_Optimize(cTaskContext& ctx) const
{
  // if the org hasn't output yet enough numbers, just return without completing any tasks
  if (ctx.GetOutputBuffer().GetNumStored() < ctx.GetOutputBuffer().GetCapacity()) return 0;
  
  double quality = 0.0;
  const cArgContainer& args = ctx.GetTaskEntry()->GetArguments();
  
  // which function are we currently checking?
  const int function = args.GetInt(0);
  
  // get however many variables need, turn them into doubles between 0 and 1
  Apto::Array<double> vars;
  vars.Resize(args.GetInt(3));
  
  double Fx = 0.0;
  
  // some of the problems don't need double variables but use the bit string as a bit string
  // string match, Fx=length - num_matched (0 best, length worst)
  if (function == 20) {
    const cString& string_to_match = args.GetString(0);
    int matched=0;
    for (int i=0; i<args.GetInt(2); i++) {
      if ((string_to_match[i] == '0' && ctx.GetOutputBuffer()[i]==0)  ||
	  (string_to_match[i] == '1' && ctx.GetOutputBuffer()[i]==1))
	matched++;
    }
    Fx=args.GetInt(2) - matched;
  }

  // string with all 1's at beginning until pattern 0101, reward for # 1's
  else if (function == 21) {
    int numOnes=0;
    int patFound=0;
    for (int i=0; i<args.GetInt(2)-3; i++) {
      if (ctx.GetOutputBuffer()[i]==1) numOnes++;
      else {
	if (ctx.GetOutputBuffer()[i+1] == 1 &&
	    ctx.GetOutputBuffer()[i+2]==0 && ctx.GetOutputBuffer()[i+3]==1) {
	  patFound=1;
	}
	break;
      }
    }
    if (patFound) Fx=args.GetInt(2)-4-numOnes;
    else Fx=args.GetInt(2);
  }

  // simply rewared for number of 1's at beginning of string, maxFx=length of string
  else if (function == 22) {
    int numOnes=0;
    for (int i=0; i<args.GetInt(2); i++) {
      if (ctx.GetOutputBuffer()[i]==1) numOnes++;
      else break;
    }
    Fx=args.GetInt(2)-numOnes;
  }