0, 5, 10, 15, 20
1, 6, 11, 16, 21
2, 7, 12, 17, 22
3, 8, 13, 18, 23
4, 9, 14, 19, 24
and if i'm here is because i'm not able... :)
can you help me?
thank you
…
generations of 50 individuals) of the same model that I got NaN's on before. As far as I can tell, it shouldn't be a division by zero problem, I'm solving the following formula: (a/10*b)-(c*d)-(e*f)-(g*h). I did save the text outcome of the run but I'm not sure which gene is what so I'm not sure how to recreate the exact situation... Is there something you want me to try?
BTW, what is a collision?
cheers,
wim
Genome[24], Fitness=-300.29, Genes [3% · 33% · 98% · 7%]
{
Record: Point Mutation at index 3: 0.0465 -> 0.0497
}
Genome[25], Fitness=NaN, Genes [3% · 33% · 98% · 9%]
{
Record: Genome was mutated to avoid collision…
ft , 4:3 (to use GH); it could be nice dock icon bars to the left or right working with laptop screen and put it on top working in GH with the 4:3 one.
This feature is cool, but not really usefull.
Best Regards.…
Your original tree contains 3 items, your desired three contains 9 items. Where do these 6 new items come from?
--
David Rutten
david@mcneel.com
Poprad, Slovakia
ng (It's a bit similar to the Knapsack problem):
I have a Variable --> XandI Have fix numbers (can we call "pieces") 9,12,15,18
I'd like to reach the X, with the summing of these numbers and using the minimum pieces ,it can't be lower than X, but it can be higher, maximum with 3.After this it has to found the most optimal combination which mostly use the same pieces
E.G.
X=98
The wrong solution is like = 1pcs of 18 = 9pcs of 9
Sum of pieces are 10
OR
= 3pcs of 18 = 1pcs of 15 = 1pcs of 12 = 2pcs of 9
Sum of pieces are 7
The right solution in this case = 5pcs of 18 = 1pcs of 9
(5*18)+(1*9)=99 it's good beacuse it's over with maximum 3 and uses the minimum pieces
Then it sends to a list like18 : 5pcs15 : 0pcs12 : 0pcs9 : 1pcsCan somebody help me ? Or is it possible to make this ?
Thank you…
Added by Petrik Kollár at 1:09am on November 10, 2017