LOGO-L> Min-max and Pirate Contest

[Andrzej Baczynski <abkomet@lodz.pdi.net>]

Yehuda's min - max problem reminded me my favorite Logo exercise. I like it
very much, because it's entirely my own concept :-)

Young pirates have found some boxes with treasure of different weight. Their
vessel is too small to carry all the treasure. It can take only 100 Pst of
load (Pst stands for "pirate stones") and these boxes are for example  [3 24
28 51 11 15 17] Pst. 
Your goal is to choose such subset of treasure which closely fit to the
vessel capacity. Overloading the vessel is prohibited.
Of course, each young pirate should know, what the "subset" mean. You may
also use random number generator to create your own list of boxes of treasure.

Maybe, this is a time for the next Logo contest. So, have your fun an write
a best Logo program which choose the best subset from a given list. 
I can't promise You a box of gold as a price, but You may win a title of The
Smartest Logo Pirate.

Sincerely Yours
Andrzej B.
Lodz, Poland

---------------------------------------------------------------
Please post messages to the Logo forum to logo-l@gsn.org.  Mail
questions about the list administration to logofdn@gsn.org.  To
unsubscribe send    unsubscribe logo-l    to majordomo@gsn.org.