Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!vrdxhq!BMS-AT!stuart
From: stuart@BMS-AT.UUCP (Stuart D. Gathman)
Newsgroups: sci.math
Subject: Re: angels and devils
Message-ID: <255@BMS-AT.UUCP>
Date: Sun, 2-Nov-86 16:33:20 EST
Article-I.D.: BMS-AT.255
Posted: Sun Nov  2 16:33:20 1986
Date-Received: Tue, 4-Nov-86 01:33:53 EST
References: <2056@princeton.UUCP> <514@aurora.UUCP> <126@fortune.UUCP> <188@mck-csc.UUCP>
Organization: Business Management Systems, Inc., Fairfax, VA
Lines: 13
Summary: What was proved

In article <188@mck-csc.UUCP>, bmg@mck-csc.UUCP (Bernard M. Gunther) writes:
> For a set of arbitrary number of rows, the two stopping blocks must be
> located (100*100*2)*N units away from each other.
  . . .
> the case where the number of rows (N) goes to infinity, the blocks must
> be built an infinite distance from each other and therefore, the angel
> cannot be trapped.  

This proves that that particular algorithm for the devil won't work in
the 2 dimensional case.  You haven't proved that *no* algorithm exists
to trap the angel.
-- 
Stuart D. Gathman	<..!seismo!{vrdxhq|dgis}!BMS-AT!stuart>