Re: The "evolution" of GA Math
DB James wrote:
>
> Al Getz wrote:
> >
> > Hi again,
> >
> >
> > Hey the graph thing sounds very interesting...might show some trends yes.
> >
> > What i was beginning to wonder is just how many operations are allowed
> > for one algorithm...adds, subtracts, multiplies, etc. If my data
> > requires 50 steps (add 1,2,3 mult 3,4,5 ... etc.) is there any
> > limit here?
> >
> >
> > Take care,
> > Al
> >
> Hello Al,
>
> Yes, a small graph might be amusing to watch while the populations struggle
> with their
> environment!
>
> Allowed operations? It is currently limited by the number of genes (same as
> the number
> of operations):
> constant MINGENES=6--minimum number of genes per being
>
> The code now randomly produces from MINGENES to MINGENES*2 genes. Just change
> MINGENES.
>
> However, as with virtually every change, there will be a probable price -- the
> more
> operations, the longer the time per try, etc.
>
> Also your question suggests interesting ruminations. Waxing theoretical, I
> can imagine
> a range of GA Math type programs with different goals. Mine is quite basic:
> it is
> designed to work on simple formulas. What is a simple formula? Here a math
> expert
> could help us. My guess it is a mathematical statement where all the
> components are
> present initially, and where simple math operations will yield the answer.
> For example
> (and I'm not sure of this) it seems that finding the area of a square given
> the side
> is simple, but finding the side given the area is not so simple and seems
> different
> in kind. Of course, GA Math can have extentions to its "basic" operations
> set, and
> so be capable of more complex calculations.
>
> For the type of problem that involves iteration or some other elaborate series
> of steps
> (i.e. where it is less a real formula and more of an algorithm, in effect),
> then a
> different type of GA is needed. Are you familiar with Core Wars? Imagine a
> Core Wars
> math population that for each being had its own memory work space and where
> looping
> and if-then operations were possible. Such a population could handle
> elaborate algorithmic
> puzzles through evolution.
>
> There is a whole lot of investigation to be done on the simpler level of the
> current
> GA Math (am looking forward to your Windows version). If one understood the
> strengths
> and weaknesses of it, then later elaborations would be more meaningful...
>
> Oh, nearly forgot to mention that I finally solved all the little issues with
> creating
> C versions of Eu programs, and of course immediately applied it to GA Math.
> Wow!
> I do recommend you create C versions of your modifications to GA Math. B-I-G
> difference
> in speed! Will be able to stick one on my HP NARC to run while I'm doing
> other things.
>
> --Quark
>
Hello again Quark,
Oh ok, perhaps i'll try the C versions at some point. Right now im
wondering about the real life applications a little more...how long it
will take to get an answer once im using it for things that will actually
provide some real benefit. I'll probably do a few more experiments
with it the way it is now. Setting it up to figure out the inverse
function would be very interesting too as sometimes it's hard to find using
other methods, if you can find it at all.
I'll post anything that turns out to be interesting.
Core wars? No, sorry, havent seen that.
Take care,
Al
And, good luck with your Euphoria programming!
My bumper sticker: "I brake for LED's"
|
Not Categorized, Please Help
|
|
