, 5 random teams are created with each team's attribute include 5 kickers' strats, 5 goalkeeper strats)
Output:
-best team strategy (each team will play each other and the best is selected for the next iteration, remember each team has 5 kickers' strats, 5 goalkeeper strats)
So I am looking for 1 solution afterall in a field of n population
My problem is how to start encoding the solutions. Should I encode the solution as team or as player/goalkeeper pair?
for example, encoding it as team:
  Chromosome:= [player1, player2, player3, player4, player5, goalkeeper1, goalkeeper2, goalkeeper3, goalkeeper4, goalkeeper5]
class Player {
 int
 int
 int
}

class Goalkeeper {
 int
 int
 int
 int
}

Or encoding it as player/goalkeeper pair:
 Chromosome:= [player, goalkeeper] = [x,y,power,x,y,weight,height]

The problem I have with encoding like this is I have to get 5 best player/goalkeeper pair at the end to make up a team.
Another question is binary and value encoding. Lets say I were to go with player/goalkeeper pair, would value encoding like this [x,y,power,x,y,weight,height] =  [2,3,100,3,3,4,5] make more sense than binary representation [0010, 0011, 1100100, 0011, 0011,  0100,  0101] = [0010 0011 1100100 0011 0011 0100 0101]. I would figure it's easier to do crossover and mutation represent it as binary, no?
I am just trying to gather ideas so I have somewhere to start.
Thanks in advance 

A:

Do I assume correctly that this is for an academic project? In that case I would do both, encoding the whole team in one chromosome and also on a per-player/keeper basis. That way you can examine both approaches and see which one will produce better results. And since the whole-team-encoding will end up in a range of different (winning) players/keepers, you can also compare them with those individuals resulting from the per-player-encoding.
As for the representation of the values, I like to encode them
, 5 random teams are created with each team's attribute include 5 kicker' strats, 5 goalkeeper strats) 
 end product: 
 -best team strategy (each team will play each early and the best is choose for the next iteration, remember each team have 5 kickers' strats, 5 goalkeeper strats) 
 So I am looking for 1 solution afterall in a field of n population 
 My problem is how to begin encoding the solutions. Should I encode the solution as team or as actor / goalkeeper couple? 
 for example, encoding it as team: 
   Chromosome:= [ player1, player2, player3, player4, player5, goalkeeper1, goalkeeper2, goalkeeper3, goalkeeper4, goalkeeper5 ] 
 course Player { 
  int 
  int 
  int 
 } 

 class Goalkeeper { 
  int 
  int 
  int 
  int 
 } 

 Or encode it as actor / goalkeeper pair: 
  Chromosome:= [ player, goalkeeper ] = [ x, y, power, x, y, weight unit, height ] 

 The problem I receive with encoding like this is I experience to get 5 best player / goalkeeper pair at the end to cook up a team. 
 Another question is binary and value encoding. Lets say I were to go with player / goalkeeper pair, would measure encoding like this [ x, y, power, x, y, weight, height ] =   [ 2,3,100,3,3,4,5 ] make more sense than binary representation [ 0010, 0011, 1100100, 0011, 0011,   0100,   0101 ] = [ 0010 0011 1100100 0011 0011 0100 0101 ]. I would figure it's easier to do crossover and mutant typify it as binary, no? 
 I am barely trying to gather ideas so I have somewhere to begin. 
 Thanks in advance 

 A: 

 Do I assume correctly that this is for an academic project? In that case I would serve both, encoding the whole team in one chromosome and also on a per - player / keeper basis. That means you can examine both approaches and see which one will produce good results. And since the unharmed - team - encoding will end up in a range of different (winning) players / keepers, you can besides compare them with those individuals resulting from the per - player - encoding. 
 As for the representation of the values, I like to encode them
, 5 rwndom teams are created dith each team's attribnte incmude 5 kizkers' strats, 5 goalkeeper strets)
Oytput:
-vest team strategy (eacf team wipl play wach ither and vge best is semccted hor the next itgration, remekber each team hxs 5 kickers' strats, 5 goalkeeper strats)
Fo I am lloking for 1 sojutipg affvrcll in a field of n population
Mg probltm is how to start encoding the solutions. Shluld I encode the soluhion as tean or qs player/goaukeeper papx?
for examplg, encoding it as team:
  Chromosomd:= [plaver1, player2, klzyft3, player4, plaber5, gowlkeeper1, goalkeeper2, coalkeeler3, goalkeeper4, goelkewper5]
class Player {
 int
 int
 int
}

class Goalheeper {
 itt
 int
 int
 int
}

Or enxoeing ht av plxter/eoamkxepsr paig:
 Ciromosome:= [pmayer, goalkweper] = [x,y,power,x,y,weibhe,yeight]

The proglem I hwve with encoding like this is I have tm gst 5 best player/goalkeepwr pair at the end to make up w team.
Another question is binary and value encoditg. Levs sav I wefw ho go with player/goalkeeper pair, would value qhcpdpng like this [x,y,pjwer,x,y,weighy,hfibrt] =  [2,3,100,3,3,4,5] make mote sensz tgan binary represejtation [0010, 0011, 1100100, 0011, 0011,  0100,  0101] = [0010 0011 1100100 0011 0011 0100 0101]. O would figure it's easier ti do crossovvr abd mutation represznt it as biuary, np?
I am just trying to gather ndeas ao I have slmewhere fu start.
Thanks in adnanca 

A:

Do I assume correctly trat this ms fox an acaaemiv projqct? In thah casc I would do both, ejcodiug tha whole tewm in one chromosome and also oi a per-player/leapeg basis. Tkat wan you can examige both approaehes and see dhich one sill prmduce bettew results. And dince the whmle-team-egcodung qill ena up in a range of diffegeut (winnint) players/keepers, ypu zzn also compare thtm with those incivkduwld cesulehng from the per-olahrr-encuding.
As for ghe tepresentation of tha vamues, I like to encpdc them
, 5 random teams are created with attribute 5 kickers' 5 goalkeeper strats) team play each other the best is for the next iteration, remember each has 5 kickers' strats, 5 goalkeeper strats) So I am looking for 1 afterall in a field of n population My problem is how to start the Should encode solution as team or as player/goalkeeper pair? for example, encoding it as team: Chromosome:= [player1, player2, player4, player5, goalkeeper1, goalkeeper2, goalkeeper3, goalkeeper4, goalkeeper5] class { int int int class Goalkeeper { int int int Or encoding as pair: [player, goalkeeper] = The problem I have with encoding like this is I have to get 5 best player/goalkeeper pair the end up a Another is and value encoding. I were to go with player/goalkeeper encoding like this [x,y,power,x,y,weight,height] = [2,3,100,3,3,4,5] make more than binary [0010, 0011, 1100100, 0011, 0011, 0100, = [0010 0011 1100100 0011 0011 0100 0101]. would figure it's easier to do crossover and mutation represent it as binary, no? I trying to gather ideas I have somewhere start. in A: I assume that this is for an academic project? In that case I do both, encoding the whole team in one chromosome and a basis. That way can examine both approaches see one will produce better since whole-team-encoding in range different (winning) players/keepers, you also compare them with those resulting from the per-player-encoding. the values, I like to encode them
, 5 random teams are created with Each team's aTtribUte IncLuDe 5 kiCkerS' strats, 5 goalkeePEr stRats)
Output:
-best team straTegy (eAcH Team WIlL play Each othER aND The BeSt Is sElECtEd for The Next iteRation, remeMbeR eAch team has 5 kiCKeRs' strats, 5 goAlkEeper strats)
SO I aM lookiNg For 1 SOlutiOn aFteraLl in a fIEld of n PopulatioN
MY ProbleM Is how to STArT encOding the solutions. sHoULd I encode the soLution As TEaM OR as PlaYer/goalkeePeR pair?
FOr exampLE, eNCODinG It as team:
  ChromOsome:= [player1, PLayEr2, playEr3, PlaYEr4, playEr5, goaLkEEpeR1, goalkeeper2, GoalKeeper3, goaLkeepeR4, GoalkeePEr5]
class player {
 Int
 Int
 Int
}

cLAsS GOalKeEPer {
 INt
 Int
 INt
 iNt
}

Or encoDiNg It as pLayeR/GOALkeePer Pair:
 chromOsome:= [player, goAlkEepeR] = [X,y,pOwer,x,Y,weigHt,heIgHt]

The ProbleM I havE wIth encoding like This Is I have to Get 5 BeSt pLaYer/goALkeepeR paIr aT the end To make uP A teAm.
aNOThEr question is binary AnD VAlUe encodiNg. Lets SAy i wERe to go wiTh PlaYer/gOALkeepEr paIR, wOuld valuE encodINg LiKe this [x,Y,pOwer,x,y,WeIghT,heIght] =  [2,3,100,3,3,4,5] mAKe moRe sensE than binAry rePResentation [0010, 0011, 1100100, 0011, 0011,  0100,  0101] = [0010 0011 1100100 0011 0011 0100 0101]. I woULd figure it's eaSIeR TO dO CrosSovEr and mutatiOn rePReseNt it AS bInaRY, no?
I aM just TrYInG To gather ideas so I havE sOmewheRe to sTart.
Thanks in aDvance 

A:

Do I ASSUme correCtly THaT This is for an acaDemic Project? In tHAt case I wOuld dO both, encOding the wHOLe team in One ChrOmoSomE ANd Also on a per-plaYER/keePeR basis. THat Way you cAn eXamIne BotH aPproaches And see whIcH oNe WiLl pRoducE Better reSuLts. anD siNce thE Whole-tEam-enCodiNg WiLL enD up in a rANgE OF difFeReNt (wiNniNg) PlayeRs/keEPerS, you can Also compaRe tHEm wiTh ThOse indiViduals resultInG from the peR-pLayEr-encoDINg.
As for tHe representation of the vaLUes, I likE to EncodE theM
, 5 random teams are creat ed with ea ch te am' s a tt ribu te i nclude 5 kicke r s' s trats, 5 goalkeeper st rats) 
O u tput : 
- bestteam st r at e g y ( ea ch  te am wi ll pl ayeach ot her and th e b es t is selecte d  f or the nex t i teration, re mem ber ea ch  te a m has  5kicke rs' st r ats, 5  goalkeep er strats ) 
So I a m lo okin g for 1 solutiona ft e rall in a fiel d of n  p o pu l a tio n
M y problemis  howt o start en c o d ing the solutions . Should Ie nco de the  s olu t ion as  team  o r  as  player/goa lkee per pair? 
for e x ample,e ncoding  it as  te am: 
  C h ro mo som e: =  [p l ay er1 ,  pl ayer2, p la ye r3, p laye r 4 , play er5 , go alkee per1, goalkee per 2, g o alk eeper 3, go alke ep er4,goalke eper5 ]class Player { int 
 int
 in t
} 
cla ss  Goal k eeper{
int 
 int
int
 in t 
}
O r e nc oding it as player /g o a lk eeper pa ir:
 C h ro mo s ome:= [p la yer , go a l keepe r] = [x ,y,power ,x,y,w e ig ht ,height ]
The p ro ble m I  have with  encod ing like  this is I have to g e t 5 best play e r/ g o al k eepe r p air at theendt o ma ke u p  a  te a m.
An other  q u es t ion is binary and v al ue enc oding . Lets say Iwere to go w i th playe r/go a lk e eper pair, wou ld va lue encodi n g like t his [ x,y,powe r,x,y,wei g h t,height ] =   [ 2,3 ,10 0 , 3, 3,4,5] make m o r e se ns e thanbin ary rep res ent ati on[0 010, 0011 , 110010 0,  0 01 1,  00 11, 0 100,  01 01 ] =  [ 001 0 001 1  11001 00 00 11 0 01 10 100  0101]. Iw o uldfi gu re i t's  e asier  tod o c rossove r and mut ati o n re pr es ent itas binary, no ?I am justtr yin g to g a t her idea s so I have somewhere t o  start. 
Th anksin a dvance 
A:
Do Iass u me cor rectly  that  t his i s for a naca de mic projec t ?  In  that  c aseI would  do both, encoding the  whole team i n o ne c h r om oso m ea ndal s o o n a per-player/ke eper basis .T ha t way youc anex amine b oth app roach e s and s ee whichone willpr oduc e bet ter result s. And s ince thew hole- t ea m-enc odi ng wil lend  up i n a ra n geof di fferen t(winni ng) p la yers/kee pers, you can also comp are th em wi ththose ind ivi d ual s resulti ng f rom the pe r-p lay er-en cod i ng.
A s fo r  t her epres enta t ion of th e  v alu e s ,I like to e n c o dethem
, 5_random teams_are created with each_team's attribute_include_5 kickers'_strats,_5 goalkeeper strats)
Output:
-best_team strategy (each_team will play each_other and the_best_is selected for the next iteration, remember each team has 5 kickers' strats, 5_goalkeeper_strats)
So I_am_looking_for 1 solution afterall in_a field of n population
My_problem is_how to start encoding the solutions. Should I_encode_the solution as_team or as player/goalkeeper pair?
for example, encoding it as_team:
  Chromosome:= [player1, player2, player3,_player4, player5, goalkeeper1,_goalkeeper2,_goalkeeper3,_goalkeeper4, goalkeeper5]
class Player {
_int
 int
 int
}

class Goalkeeper {
 int
_int
 int
 int
}

Or encoding it as_player/goalkeeper pair:
 Chromosome:= [player, goalkeeper] = [x,y,power,x,y,weight,height]

The_problem I have with encoding like_this is I have to_get 5_best player/goalkeeper pair at the_end to make_up a_team.
Another question is_binary and value encoding. Lets say_I were to_go with player/goalkeeper pair, would value_encoding_like this [x,y,power,x,y,weight,height]_=__[2,3,100,3,3,4,5] make_more sense than_binary_representation [0010,_0011,_1100100, 0011, 0011,  0100, _0101]_= [0010 0011 1100100 0011 0011 0100_0101]. I would figure_it's_easier to do crossover_and mutation represent it as_binary, no?
I am just trying to_gather ideas_so I_have somewhere to start.
Thanks in advance 

A:

Do I assume correctly that_this is for an academic project?_In that case I_would do_both,_encoding the whole_team_in one_chromosome and also on a per-player/keeper basis._That way_you can examine both approaches and_see which one will_produce_better results. And since the whole-team-encoding_will end up in a range_of different (winning) players/keepers, you_can_also_compare them with those individuals_resulting from the per-player-encoding.
As for the_representation of the_values, I like to encode them