Re: Simple problems to solve genetically

Article View: comp.ai.genetic

Article #101

#101

From: Peter Bruhn
Date: Tue, 12 Jan 1993 07:15

26 lines
1470 bytes

In article <1993Jan11.145224@IASTATE.EDU> from [Mon, 11 Jan 1993 20:52:24 GMT] you wrote:
 > In article <1993Jan8.202702.21180@fcom.cc.utah.edu>,
 > freier@mail.physics.utah.edu (rodney james freier) writes:
 > >   I'm looking for a few simple games/problems that can be played/solved
 > > genetically.  I'm just trying to practice with the concept.
 > 
 >   Just about any game with an evaluation phase can be done (chess, checkers,
 > tic-tac-toe).  Just have an alpha-beta search with node rating, and evolve
 > different ways to rate nodes.  I did this way back with connect-four.
 > 
 >   I think some of the top chess programs already do this.

Really? I am highly interested in more information. What chess program does
use GAs? Any references?

 >  |  __L__
 > -|-  ___  Warren Kurt vonRoeschlaub
 >  |  | o | kv07@iastate.edu
 >  |/ `---' Iowa State University
 > /|   ___  Math Department
 >  |  |___| 400 Carver Hall
 >  |  |___| Ames, IA  50011
 >  J  _____

Thanks a lot,
Peter (bruhn AT uxe.wu-wien.ac.at)

Technical Details

Message-ID: <7268265448-38850@exaia>

Path: arc1-ca.pugleaf.net!sparky!uunet!nestroy.wu-wien.ac.at!exaia!bruhn

References: <1993Jan8.202702.21180@fcom.cc.utah.edu> <1993Jan11.145224@IASTATE.EDU>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!nestroy.wu-wien.ac.at!exaia!bruhn
From: bruhn@exaia (Peter Bruhn )
Newsgroups: comp.ai.genetic
Subject: Re: Simple problems to solve genetically
Date: Tue, 12 Jan 93 09:15:44 MESZ
Organization: WU-Wien
Lines: 27
Distribution: world
Message-ID: <7268265448-38850@exaia>
References: <1993Jan8.202702.21180@fcom.cc.utah.edu> <1993Jan11.145224@IASTATE.EDU>
NNTP-Posting-Host: exaia.wu-wien.ac.at

Reply to Parent Message