Hey guys, So I am a big fan of math, but at the moment, I am limited to calculus, so I dont really know much math at all. With that being said, I also happen to watch the show numbers, which is the first place I heard about the problem P vs NP. So after looking it up, I saw that it is a problem that if anyone can prove, they are awarded a million dollars; sounds nuts!! Anyway, I was wondering what could be that insanely hard that so many brilliant minds could work on it but still not figure it out, so of course, I looked for a problem statement, and with my limited math knowledge, it was similar to reading a foreign language. This issue popped up again however, when I, after playing a few games of free cell to pass the time, searched to find out if anyone made a freecell algorithm. (I know people have made them for windows games like minesweeper, but it seemed to me this one would be alot more difficult because there are so many possibilities that change constantly, but then again, it seems hard for me to believe that chess programs can be made to play perfect also.) So anyway, now as I am reading about this, it says that a freecell algorithm would somehow solve the problem P vs NP. So now as if I wasn't already confused enough from my first glance at the problem statement, I went back for a second helping. Still, written in sanskrit to me. So, I was wondering if one of you math geniuses out there could try to come up with an analogy as to what this problem actually is? Just to put my curiosity to rest and help me get some sleep! (just kidding of course.) Thanks in advance for any attempt at explaining a supposedly impossible math problem to a calculus student.