On Oct 3, 2004, at 10:29 AM, Joe Cheng wrote:

> I thought it might be a good idea for me to explain exactly what is 
> interesting about this test case.  There are 5 Skywalkers and 4 
> non-Skywalkers.  So the moment a non-Skywalker is assigned to another 
> non-Skywalker, a solution is impossible.

Hmm, maybe I'm not awake yet this morning, but to me the solution seems 
impossible from the start, by definition.  The 5 Skywalkers need to be 
santas for non-Skywalkers, of which there are only 4 choices.  I can't 
make that work out, but please correct me if I'm wrong.

James Edward Gray II