From: Stu Glaser <gostuyourself@...>
Date: 2006-02-06T08:45:36+09:00
Subject: Re: [QUIZ] Splitting the Loot (#65)

Actually, it's more closely related to the Partition problem (which is 
also NP-Complete).  (In fact, the 2-person instance is the Partition 
problem).

Translation for the non-Computer Science: the problem cannot be solved 
(exactly) without using a brute-force (slow) recursive-like algorithm.

-Stu

Antonio Cangiano wrote:

> Patrick Hurley wrote:
>
>> I just certainly hope there is not too many treasures, I am pretty
>> sure this is NP complete.
>
>
> It's the famous Subset Sum Problem (a special case of the knapsack 
> problem), and generally it's an NP-Complete problem.
>
> Cheers,
> Antonio