Article View: rec.games.programmer
Article #1691Genetic Algorithms
From: Robert G Fermier
Date: Sun, 22 Nov 1992 08:21
Date: Sun, 22 Nov 1992 08:21
13 lines
1234 bytes
1234 bytes
What about having each mutant child play against it's parent some large number of times, while the user is reading text or thinking or whatever, or run it as a background process. Any child which can consistently beat its parent should be considered a better algorithm. I suppose this might lead to inbred algorithms, which are finely tuned for beating their predecessors but suck at beating humans. Perhaps having different strains, some of which were based off of extrapolations from human moves (in position X, he did Y, so our new algorithm will do Y also now that we are in position X) would solve this problem. Just an idea, I really don't know much about genetic algorithms. -- Rob Fermier rfermier@athena.mit.edu
Technical Details
Message-ID:
<1992Nov22.082115.14266@athena.mit.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!olivea!charnel!sifon!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!rfermierShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!olivea!charnel!sifon!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!rfermier From: rfermier@athena.mit.edu (Robert G Fermier) Newsgroups: rec.games.programmer Subject: Genetic Algorithms Message-ID: <1992Nov22.082115.14266@athena.mit.edu> Date: 22 Nov 92 08:21:15 GMT Sender: news@athena.mit.edu (News system) Organization: Massachusetts Institute of Technology Lines: 13 Nntp-Posting-Host: m1-142-15.mit.edu