Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site mmm.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!stolaf!mmm!cipher
From: cipher@mmm.UUCP (Andre Guirard)
Newsgroups: net.puzzle
Subject: Re: pennies puzzle (response to SPOILER)
Message-ID: <525@mmm.UUCP>
Date: Wed, 19-Feb-86 13:45:38 EST
Article-I.D.: mmm.525
Posted: Wed Feb 19 13:45:38 1986
Date-Received: Fri, 21-Feb-86 05:21:32 EST
References: <953@houxa.UUCP> <904@whuxlm.UUCP>
Reply-To: cipher@mmm.UUCP (Andre Guirard)
Organization: 3M Company, St. Paul, Minn.
Lines: 33
Summary: 

In article <904@whuxlm.UUCP> dim@whuxlm.UUCP (McCooey David I) writes:
>> Imagine a two-player game, in which each of the players begins
>> with an infinite number of pennies.  There exists a round table,
>> and each player in his turn places a penny on the table.  (Turns
>> are alternated).  The game ends when there is no more room on the
>> table for any pennies.  The person who last put a penny on the table
>> is declared the winner.
>> 
>> Question:  Given that one of these players has a winning strategy,
>>    	which player (the first, or the second) can always win?  
>> 	Prove your answer by giving the strategy.
>> 
>The second player can always win if he uses the following strategy:
>
>	Considering the center of the table as the "origin", always
>	place his penny at a spot reflected through the origin from
>	where his opponent just placed his last penny.
>
>Using this strategy, the second player will always have a spot to place his
>penny because he is simply mirroring the actions of the first player.

This is a very elegant solution, but it is unfortunately wrong.  This
strategy will work, but it will only work for the first player, after
s/he has started the game by playing to the exact center of the table
(a move impossible to "mirror").


-- 

 /''`\						Andre Guirard
([]-[])						High Weasel
 \ x /	   speak no evil			ihnp4!mmm!cipher
  `-'