home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!uwm.edu!biosci!agate!doc.ic.ac.uk!citycs!lionel
- From: lionel@cs.city.ac.uk (Lionel Tun)
- Newsgroups: talk.origins
- Subject: Re: Laying a trap
- Keywords: Computer program, random, mutation, chess
- Message-ID: <1992Nov20.140744.7237@city.cs>
- Date: 20 Nov 92 14:07:44 GMT
- References: <1992Nov18.133247.8546@city.cs> <1992Nov19.215001.3750@cc.uow.edu.au>
- Sender: news@city.cs (News)
- Organization: City University, London
- Lines: 33
-
- In article <1992Nov19.215001.3750@cc.uow.edu.au> plumpton@wampyr.cc.uow.edu.au (David Plumpton) writes:
- >lionel@cs.city.ac.uk (Lionel Tun) writes:
- >>1
- >>Lets say there is a computer program which `knows' the
- >>legal moves of chess - lets call it ChessMover.
- >>ChessMover plays very poor chess because its moves are
- >>made at random. But it does play very fast. ChessMover
- >>is small, compact and extremely efficient. But it plays
- >>bad chess because it has not been designed with any
- >>chess playing algorithms at all.
- >
- >>Would it be possible to subject ChessMover to random
- >>mutations, so that eventually you evolve ChessPlayer,
- >>a chess program which plays very well, say at master
- >>level?
- >
- >This is a poor analogy for evolution or abiogenesis (which ever one you're
- >attempting to analyse here).
-
- Evolution, as the program already exists.
-
- >A chess program does not reproduce.
- >No form of natural selection is applied to it.
-
- Natural selection: You can have the programs play against
- each other automatically.
- Reproduction: You can bias your selection for the next
- generation towards winners.
-
-
- --
- Lionel Tun (lionel@cs.city.ac.uk)
- Vision Group, City University, London, EC1V 0HB. 071-477 8000 x 3889
-