[vanekl]

some of the coolest problems are the problems that don't have a polynomial solution, so clever heuristics have to be discovered that work in most scenarios and compliment your data and requirements. for example, trying to solve a problem when there are not enough cpu cycles to even traverse a fraction of the total search domain. instead of looking for the perfect solution, you search for a solution that is good enough. which leads to the next question: how do you know when you've got a good enough solution?