Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Best Algorithm Variation

Author: Pat King

Date: 14:44:49 04/28/04

Go up one level in this thread


On April 27, 2004 at 17:03:25, Roger D Davis wrote:

>On April 27, 2004 at 16:33:56, Pat King wrote:
>
>>I've tried genetic algorithms before. Depending on how you implement them,
>>convergence will be extremely slow to non-existent!
>>
>>you just
>>end up with a bunch of more or less random weights.
>>
>>Pat King
>
>Seems like you'd want to do some tuning using situations where one move is known
>to be better. Then you can tune for more subtle situations.
>
>Roger

The whole point of GA, IMHO, is that the tuning process can be pretty much
"hands off". If you've a group of test positions for which the best moves are
known, there are many other techniques that will give quicker and better
results, at least in terms of matching the training set.

OTOH, you could be arguing as I (meant to have) said earlier: GA doesn't work
well at all for chess. In that case, we are totally in agreement :)

Pat



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.