Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84 exptools; site whuxlm.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!whuxlm!dim
From: dim@whuxlm.UUCP (McCooey David I)
Newsgroups: net.puzzle
Subject: Re: pennies puzzle (SPOILER)
Message-ID: <904@whuxlm.UUCP>
Date: Tue, 18-Feb-86 15:23:52 EST
Article-I.D.: whuxlm.904
Posted: Tue Feb 18 15:23:52 1986
Date-Received: Wed, 19-Feb-86 03:47:49 EST
References: <953@houxa.UUCP>
Organization: AT&T Bell Laboratories, Whippany
Lines: 23

> 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.

					Dave McCooey
					AT&T Bell Labs, Whippany
					ihnp4!whuxlm!dim