Jump to content
  • Advertisement

Nice Coder

Member
  • Content count

    2918
  • Joined

  • Last visited

Community Reputation

366 Neutral

About Nice Coder

  • Rank
    Contributor
  1. Nice Coder

    Genetic Algorithms

    y = sin(x)*cos(z)+ x^2*z^2 for x = 0 z = 0 = 0 * 1 + 0^1*0^2 = 0 Thats the lowest (non-negitive) it can get. If you need two different values, x = 0 z = 1/infinity Thats pretty much the same. For negitive, the solution would probably -infinity for both x and z. If both can't be the same, then -infinity for x, x - 1 for z. As for ga's, you need to give em a better problem... (how about getting a ga to make an ann, thats about the best thing i've seen em do :-)) Either way, nice tutorial. Any chance you can do something on simulated annealing. (its a nifty thing to use). From, Nice coder
  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

Participate in the game development conversation and more when you create an account on GameDev.net!

Sign me up!