Re: [Jscheme-user] ILC 2003 Programming Contest

[Ken A. <kan...@bb...>]

Tim,
I agree this looks like an interesting approach, though i have not looked at it in detail yet.  

I've been thinking along the lines of Logo Turtle Geometry.  The turtle could draw each piece given a starting orientation using a sequence of primitives like 
I - in tab
O - outTab
R - right turn
L - Left turn
More details later if they warrent discussion.

k
At 11:52 AM 8/27/2003 -0400, Geoffrey Knauth wrote:
>On Monday, August 25, 2003, at 01:38 PM, Ken Anderson wrote:
>>Here's a Lisp programming contest:
>>http://www.ravenbrook.com/doc/2003/05/28/contest/
>
>On Tuesday, Aug 26, 2003, at 13:20 US/Eastern, Timothy John Hickey wrote:
>>For each of the 64 spaces on the board we would keep track of which particular puzzle pieces could go there.
>>This task is simplified if we consider each orientation of the 13 pieces as a different piece. (So there are now
>>13*4 = 52 different pieces, and a constraint that exactly one piece from each group of 4 must be used).
>
>That's a really neat idea.  It almost makes the problem seem easy.  You must be a genius.  (My boss 16 years ago said that genius was not about wattage, it was the ability to look at something from a slightly different perspective and see something others could not.)
>
>Geoffrey
>--
>Geoffrey S. Knauth | http://knauth.org/gsk
>
>
>
>-------------------------------------------------------
>This sf.net email is sponsored by:ThinkGeek
>Welcome to geek heaven.
>http://thinkgeek.com/sf
>_______________________________________________
>Jscheme-user mailing list
>Jsc...@li...
>https://lists.sourceforge.net/lists/listinfo/jscheme-user