Regarding the solution, why is it that modern computers don't help? If it is a problem of tediousness of examining all possibilities, could a program written for a computer [a super computer?] get that job done for this problem or other such problems?
Surely all this N, P, NP, NPhard, Polynomial time, Traveling Salesman Problem stuff has been getting less daunting as chip speeds and capacities increase. What about all these clusters and memristor stuff?Quote: MathExtremist
There is actually a large class of problems for which brute-force computational analysis is simply insufficient. Some of them, like this one, grow exponentially in complexity as the number of examinations increases.
To put things in perspective, work has been done to demonstrate that there are somewhere around
different positions in the game of chess.
Surely all this N, P, NP, NPhard, Polynomial time, Traveling Salesman Problem stuff has been getting less daunting as chip speeds and capacities increase. What about all these clusters and memristor stuff?
I've never felt good about calling a problem impossible to solve merely because so far its not been solved.
I'm pretty sure this is how they offered it in casinos, back in the day. Klondike is one of the statutorially-defined gambling games in Nevada. See NRS 463.0152.
That number is probably being used as a password for encrypted documents somewhere. If you misplace it, you could probably look it up on the Internet.