From: Martin Coxall <pseudo.meta@...>
Date: 2006-10-13T17:55:55+09:00
Subject: Re: [QUIZ] Posix Pangrams (#97)

> >
> > There's also the matter of program structure. When dealing with an
> > NP-Hard problem, you know that any solution geared to do a heuristic
> > search quickly is not guaranteed to find the minimum.
>
> We haven't talked a lot about this in the past, but I take a pretty
> relaxed approach to tough quiz problems.  Find a good heuristic and
> get close.  That's fine with me.

I think it's fine. Now if you'd said "find a solution and then prove
using the symbolic algebra of your choice that it's optimal" would be
a different story.

Next Ruby Quiz: Prove that P = NP, unless it doesn't, in which case
prove that P != NP.

Martin