News for hackers. Stuff that matters.
Re:A way to deal with enormous branching factors in strategy... by xxbondsxx on Friday March 25, 2016 @02:55PM (#11361935)
Isn't this similar to A* or alpha-beta search but with a fitness function and the random-ness of evolutionary algorithms?

I feel like it might apply well to a strategy game but for something like chess, would not fair as well. Mixing two great move sequences in chess would probably result in disaster

There are no comments on this comment yet.