Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!bellcore!ulysses!unc!nair
From: nair@unc.UUCP (Anil Nair)
Newsgroups: sci.math
Subject: Re: angels and devils ( 1-dimensional equivalent )
Message-ID: <66@unc.unc.UUCP>
Date: Mon, 20-Oct-86 13:12:11 EDT
Article-I.D.: unc.66
Posted: Mon Oct 20 13:12:11 1986
Date-Received: Tue, 21-Oct-86 07:11:04 EDT
References: <2056@princeton.UUCP>
Reply-To: nair@unc.UUCP (Anil Nair)
Distribution: net
Organization: CS Dept, U. of N. Carolina, Chapel Hill
Lines: 19
Keywords: Core wars


  Does anyone remember the article on Core Wars in one of the
  Computer Games column in Scientific American . That had a
  similar problem played on a 1-dimensional array . For 
  practical purposes , they had a finite circular array ; but
  you can think of a conceptual infinite one dimensional 
  array .

  The angel and devil would be two programs on the array playing
  a particular strategy . Drawing the analogy to this situation ,
  you can have other strategies for the angel and the devil in 
  this matrix . 

  I am sorry ,  but I don't have an answer as to who will win 
  even in the 1-dimensional case . If I remember right , the 
  article had statistical info on who wins most of the time .


  Anil Nair - UNC