[buug] Ian' circle packing interview question

[Karen Hogoboom]

I choose not to work on this problem unless you want to pay me to.

On Sat, May 28, 2011 at 11:21 PM, Ian Zimmerman <itz at buug.org> wrote:

> On Fri, 27 May 2011 15:00:57 -0700
> Paul Ivanov <pi at berkeley.edu> wrote:
>
> Paul> Given a circular table, come up with a strategy for placing
> Paul> same-sized coins which should fit completely on the table, with
> Paul> the objective that, as you and your opponent alternate in putting
> Paul> coins down, you will place the *last* coin and your opponent will
> Paul> not be able to place a coin anywhere else.
>
> That is correct.  It turns out to work for a square table as well, or
> a hexagonal one, or even an elliptical one.  But not an arbitrary table.
>
> > http://www2.stetson.edu/~efriedma/cirincir/
> > http://mathworld.wolfram.com/CirclePacking.html
>
> You need _way_ less mathematics for this problem.  Just mathematical
> induction, really.
>
> --
> Ian Zimmerman
> gpg public key: 1024D/C6FF61AD
> fingerprint: 66DC D68F 5C1B 4D71 2EE5  BD03 8A00 786C C6FF 61AD
> Rule 420: All persons more than eight miles high to leave the court.
> _______________________________________________
> Buug mailing list
> Buug at weak.org
> http://www.weak.org/mailman/listinfo/buug
>



-- 
Karen Lee Hogoboom
Computer Programmer
Phone:  (510) 666-8298
Mobile:  (510) 407-4363

khogoboom at gmail.com
http://www.linkedin.com/in/karenlhogoboom
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://buug.org/pipermail/buug/attachments/20110529/cf760fe0/attachment.html>