taking the help of the hall) - page 10

New comment
 
joo, please advise a good GA read for a layman.
 
i.e. I enter the value of H and it gives me the values a,b,c,d...
 
vitali_yv:
joo, can you please recommend a good GA read for a layman?
Can't advise - I haven't read any. :O
 

H(max)=a(max)+b(max)+c(max), where a(max)... - is the maximum value of a

the number H naturally turns out to have a maximum value above which it cannot be equal to

 
joo:
Can't advise - I haven't read any. :O

I see).

timezero, you are so masterful at confusing things)

 
timezero:
values of a,c,d... with the same H, it is possible that there may be different these variations also need to be found.
No, this guy is definitely hacking into something...
 

))))))))

Nah, if I wanted to hack something, I wouldn't shout it all over the internet for anyone to know about it, would I?

I'd do it quietly then.

 
Integer:

Because there are many correct choices. If the numbers are such that there is only one correct option, the GA will not find it, or only stumble upon it by chance.

You're right - mine won't find it. But there's another reason.

My algorithm works with genes evenly distributed on the number line. By the problem statement, after converting genes from genotype to phenotype we obtain the following arrangement of numbers on the straight line, for example for a

Thus, a change in the gene on some parts of the line will have no effect on the FF.

By slightly changing the conditions of the problem so that there is only one solution:

double A[20] ={11.1,12,16,19,23,25,26,27,29,34,37,38,43,46,48,58,59,62,64,73};
double B[20] ={ 2,3 ,7 ,9.1 ,11,16,18,31,32,33,41,42,43,47,53,54,60,61,64,81};
double C[20] ={ 7,9 ,15,22,24.1,25,27,28,29,34,42,44,46,52,53,64,66,67,68,70};
double D[20] ={ 1,5 ,4 ,15,18,19,24,32,34,39,42,46,47.1,48,49,60,61,68,72,77};
double E[20] ={ 9,12,19,21,24,27,29.1,35,43,45,46,55,58,61,64,65,66,68,71,82};
double F[20] ={ 6,11,12,22,26,32,42,48,52,54,58,61,64.1,65,72,83,84,87,94,97};
double G[20] ={ 4,9 ,14,15,19,26,35,37,39,40,45,48,52,53,59,63,67,70,74.1,76};

//11.1+9.1+24.1+47.1+29.1+64.1+74.1=11.1+9.1+24.1+47.1+29.1+64.1+74.1=258.7

"marking" the required variables, the algorithm cannot find the solution.


It begs the addition of the possibility to change the density distribution on the numeric line for the variables that would allow to solve such problems successfully. I will think about it.

 
Please send me a link where you can download C++, but without any passwords to the archive and stuff like that, I'll throw something in C and see what happens.
 
timezero:
Please send me a link where I can download C++ without any passwords to archives and stuff like that, I'll make some notes in C and see if I can work it out.

Cornet Obolensky walks through the park, and looks at Lieutenant Rzhevsky pulling a piano....

- Lieutenant, where are you going?

-I bought a piano...

- Can you play, too?

- Oh, bullshit, tomorrow Cornet Oblomov will come and show you how to do it ......

;)

Try Delphi or BASIC.... ;)

1...34567891011
New comment