AZSPCS Point Packing contest

Whatever is on your mind, whether Lisp related or not.

AZSPCS Point Packing contest

Postby nuntius » Sun Jul 12, 2009 11:47 pm

The following contest might interest a few people here.

N=2,3,4 aren't too hard to solve by hand. My plan is to toy with N=5,6,7 and then write a search algorithm.

FWIW, I couldn't find a minimal-bounding-circle algorithm in lisp, but plan to start with an ltk gui anyway... ... ssage/3998
Since the Snakes contest used a bounding circle algorithm to score the
solutions, I'd like to repost the links I found on this algorithm:

Smallest Enclosing Balls of Points:
Here is my C version of the miniball C++ package (I converted it from
C++ to C then to PHP):

Finally, the PHP scorer for Snakes is here:

If you need a faster algorithm (not so sure, since it relies on sqrt), try: ... m_0107.htm

If I remember correctly, no bug was found in the PHP implementation of
the bounding circle (note that the program computes the square of the

User avatar
Posts: 509
Joined: Sat Aug 09, 2008 10:44 am
Location: Burlington, MA

Return to The Lounge

Who is online

Users browsing this forum: No registered users and 3 guests