[17:08]: it's a binary state, you can keep it as simple as `genome[i] = not(genome[i])`

I am one of the faithful visitors of your great contents and really appreciate your rewarding efforts and time. I'll be grateful if you address the statistical analysis with Python as a cornerstone of datascience, if applicable.

Great video! I'm working more and more to optimize my work processes. And Never actually thought about using this. Thanks!

Thanks for sharing the concept

Again taking over Awesome town! THX

Great video, thanks!

another interesting video. Thanks a lot :)

In mutate(), using arithmetic to do logic manipulatiosn is the kind of thing we used to do in the 1970s with primitive BASIC. I would suggest using the exclusive OR operator (XOR) - "^" .. or in this case, the XOR-assignment operator, "^=" ... """a OR b, but not both""" 0^0 -> 0 0 ^1 -> 1 1^0 -> 1 1^1 -> 0

it's really helpful, please it is possible to use Evolutionary algorithm to create workout plan?

10:42 that's a slick generator. ty vid

Thanks you

Csn you tell machine learning algorithms like candidate algorithm and decision tree algorithm

Possibly a dumb question, but what is with the a:0 and b:0 on line 11 ? It was almost like the IDE added those in or something. If I typed them in, I got invalid syntax. If I just had randint(0,1) instead, on line 11, it worked. Thanks.

Wow❤❤❤

I think the reason why the fitness wasn't increasing was in the function select_parent(). While higher fitness individuals may have a better chance at reproducing, it isn't likely enough for them to reproduce

I'm not sure about the select_parent() function. You are going through the pool of candidates, cumulating their respective fitness, until you hit the first candidate who's cumulated fitness is bigger than some random threshold. How does that guarantee that a candidate with a bigger fitness is statistically more often chosen over a candidate with less fitness? Shouldn't be some type of sorting? I get the impression, the candidate pool is randomly sorted; we're randomly choosing a threshold point; and therefore randomly returning any candidate that just happens to be the first to cross the (cumulated!) threshold. WDYT?

@doyouknowdawae1343

3 ай бұрын

A better implementation would be to first perform elitism, where say 10% of the solutions with the highest fitness are automatically entered into the new population. Then you could select the parents through tournament selection which would compare n amounts of solutions, with the best one (Highest Fitness) being chosen as a parent. After performing tournament selection to get 2 parents you could then proceed to crossover as described in the video. I believe this would achieve what you wanted, with more fit solutions being chosen over weaker candidates.

The fitness values in the one max problem were off

I think game theory is interesting too

how if the population is not binary state

do you think using PYGAD could make genetic algorithm easier ?

moar of those!

Please share the code.

Hi

You show interesting code, but you haven't tested it before, and are learning how it performs on-camera. How about spending an hour beforehand figuring out exactly what to show?