None of the Task s will be impossible to perform. No object will have a weight greater than maxWeightToCarry , so it will be possible to carry each object. It will be possible to reach each fromNode and each toNode by traversing Connection s from the startingNode . Connection s may not satisfy the triangle inequality, that is, it may be the case that a direct Connection between two Node s is not the shortest path between them. No other a priori information about the Connection s, Node s, or Task s is available.
Lower scores are, of course, better.
The Challenge prize will be divided between the overall winner and the best scoring entry from a contestant that has not won the Challenge recently. If you have wanted to compete in the Challenge, but have been discouraged from doing so by the quality of the entries from our veteran contestants, perhaps this is your chance at some recognition and a share of the Challenge prize. This will be a native PowerPC Challenge, using the CodeWarrior Pro 6 environment. Next month, perhaps we'll solve the problem of how to motivate a couple of teenage children to perform these Task s, allowing the broken foot more time to rest and heal. But perhaps that would be too difficult, even for Challenge readers.