Article View: rec.games.programmer
Article #747Re: Computer-Controlled Players (New, Great Thread!)
From: Peter Y. Chen
Date: Sun, 16 Aug 1992 07:18
Date: Sun, 16 Aug 1992 07:18
18 lines
1444 bytes
1444 bytes
In article <BsxD9p.Mt8@rice.edu> amitp@owlnet.rice.edu writes: >In article <Bsx9rB.F6H@news.cso.uiuc.edu>, tmkk@uiuc.edu (Khan) writes: >|> > >With genetic algorithms, you might run the for GA 10,000 generations (???), >and you could pick out easy opponents at 3,000, and then medium level ones >at 7,000 and then the toughies at 10,000. > Think of the potential! If the players start out with unevolved AI's, they can train the computer themselves, and maybe they can trade the AI routine with their friends, so this would be like a pseudo head-to-head mode. One more good thing about GA is that the player "should" never get bored, since he's supposedly playing against different players every time he plays (assuming evolution continues, not just stops before the game companies ship the games out). -- Peter
Technical Details
Message-ID:
<1992Aug16.071809.11186@pasteur.Berkeley.EDU>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!slc3.ins.cwru.edu!agate!pasteur!cory.Berkeley.EDU!pychenReferences:
<BsvzMw.LFy@news.cso.uiuc.edu> <Bsx9rB.F6H@news.cso.uiuc.edu> <BsxD9p.Mt8@rice.edu>Show Full Headers
Complete Article Headers
Newsgroups: rec.games.programmer Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!slc3.ins.cwru.edu!agate!pasteur!cory.Berkeley.EDU!pychen From: pychen@cory.Berkeley.EDU (Peter Y. Chen) Subject: Re: Computer-Controlled Players (New, Great Thread!) Message-ID: <1992Aug16.071809.11186@pasteur.Berkeley.EDU> Sender: nntp@pasteur.Berkeley.EDU (NNTP Poster) Nntp-Posting-Host: cory Organization: University of California, at Berkeley References: <BsvzMw.LFy@news.cso.uiuc.edu> <Bsx9rB.F6H@news.cso.uiuc.edu> <BsxD9p.Mt8@rice.edu> Date: Sun, 16 Aug 1992 07:18:09 GMT Lines: 18