Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!lll-crg!nike!sri-spam!sri-unix!hplabs!tektronix!reed!trost
From: trost@reed.UUCP (Bill Trost)
Newsgroups: sci.math
Subject: Re: angels and devils
Message-ID: <4416@reed.UUCP>
Date: Sat, 1-Nov-86 05:14:49 EST
Article-I.D.: reed.4416
Posted: Sat Nov  1 05:14:49 1986
Date-Received: Tue, 4-Nov-86 01:14:32 EST
References: <2056@princeton.UUCP> <514@aurora.UUCP> <126@fortune.UUCP> <188@mck-csc.UUCP> <5023@brl-smoke.ARPA>
Reply-To: trost@reed.UUCP (Bill Trost)
Organization: Reed College, Portland, OR
Lines: 10

I have a problem that is somewhat similar to this problem.  Imagine quantity
of hunters on a "very large" section of a plane (very large => boundary
cases are neglibible).  Now, each hunter shoots his nearest neighbor.
Question:  How many hunters remain living?

This question can be put into the 3-dimensional and 1-dimensional cases as
well.  The 1-d case is fairly easy:  half the hunters will get shot by one
hunter, a fourth will get shot by two, and a fourth will survive.
-- 
.signature, aka "Reed College", aka "tektronix!reed!trost"