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...
http://tech.groups.yahoo.com/group/AlZi ... 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:
http://web.archive.org/web/200712222115 ... 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