meteor puzzle
- From: "metaperl.com" <metaperl@xxxxxxxxx>
- Date: Mon, 10 Dec 2007 02:28:49 -0800 (PST)
I noticed that SBCL does not have an entry for the Alioth Shootout
Meteor Puzzle:
http://shootout.alioth.debian.org/gp4/benchmark.php?test=meteor&lang=all
So, being 1/2-way through PCL, now is the time to start thinking about
contributing it.
The spec of the problem and a series of solutions is given here:
http://www-128.ibm.com/developerworks/java/library/j-javaopt/
But I will start with my first question about their listed solution.
Why is each piece used exactly 5 times? Is an acceptable solution to
this puzzle to use one piece 6 times and another 4? I saw nothing in
the problem description precluding this. In fact, I dont even see a
problem description. They just start offering solutions.
.
- Follow-Ups:
- Re: meteor puzzle
- From: Nicolas Neuss
- Re: meteor puzzle
- From: Isaac Gouy
- Re: meteor puzzle
- From: smallpond
- Re: meteor puzzle
- From: Maciej Katafiasz
- Re: meteor puzzle
- Prev by Date: Re: SETF and variable issues in Self Similar program.
- Next by Date: Re: array processing in Lisp
- Previous by thread: network programming
- Next by thread: Re: meteor puzzle
- Index(es):