I heard word from a reliable source that this is indeed a publicity stunt for the re-release of 2001 to come later this year. The monolith shall be bouncing around to different places around the country over the next couple months. . .
You may reduce the workload dramatically, but you still have too much workload for even the most powerful of computers to compute in a reasonable amount of time, because the problem is still not "trivial" (a term my professor used to use to describe easy, ie polynomial or in some cases simply sub exponential time). I have worked on a number of similar problems (ie, given 4 particular pieces, give the one shortest winning sequence). This search tree is incredibly huge unless you utilize some of the heuristic ideas that algorithm genius' (as I call them) have determined to be most efficient for games such as chess, but that still requires that you know how to judge a good chess board, which is sadly something that I suck horribly at. If I remember correctly, the best algorithm I could come up with took approximately 4 minutes on a Pentium II 400, 128M RAM to guarantee the winning moves for a very limited board state. Given that the problem is not a limited state (in that any algorithm still must consider a much larger number of pieces, I dont think we would see a computer calculatable solution for this problem any time in the near future). This is why games such as the chessmaster series make us algorithm design guys drool. [Sn]
I agree with the intent, but i feel very little or no attention is being paid to how we are going to clean this thing up (or are we?)
Out of sight, out of mind.
I feel we are being rather short sighted. The same short sightedness is why we have so many ecological troubles today. "If we just dump it into the ocean, what can it hurt?"
With the billions upon billions of dollars we spend on defense (offense?) I would think we could discover a more efficient (and cleaner) method of finding water.
[Sn]
-The above comments are mine, but I wont admit to them.
Slashdot Mirror
I heard word from a reliable source that this is indeed a publicity stunt for the re-release of 2001 to come later this year. The monolith shall be bouncing around to different places around the country over the next couple months. . .
You may reduce the workload dramatically, but you still have too much workload for even the most powerful of computers to compute in a reasonable amount of time, because the problem is still not "trivial" (a term my professor used to use to describe easy, ie polynomial or in some cases simply sub exponential time). I have worked on a number of similar problems (ie, given 4 particular pieces, give the one shortest winning sequence). This search tree is incredibly huge unless you utilize some of the heuristic ideas that algorithm genius' (as I call them) have determined to be most efficient for games such as chess, but that still requires that you know how to judge a good chess board, which is sadly something that I suck horribly at. If I remember correctly, the best algorithm I could come up with took approximately 4 minutes on a Pentium II 400, 128M RAM to guarantee the winning moves for a very limited board state. Given that the problem is not a limited state (in that any algorithm still must consider a much larger number of pieces, I dont think we would see a computer calculatable solution for this problem any time in the near future). This is why games such as the chessmaster series make us algorithm design guys drool. [Sn]
I agree with the intent, but i feel very little or no attention is being paid to how we are going to clean this thing up (or are we?)
Out of sight, out of mind.
I feel we are being rather short sighted. The same short sightedness is why we have so many ecological troubles today. "If we just dump it into the ocean, what can it hurt?"
With the billions upon billions of dollars we spend on defense (offense?) I would think we could discover a more efficient (and cleaner) method of finding water.
[Sn]
-The above comments are mine, but I wont admit to them.