Create a computer program to play Tetris. For the maximum computational challenge, assume the program gets foreknowledge of the entire upcoming stream of pieces. (It's given input the random number seed.)
We rely on the famous result that, even with perfect play, any player will eventually lose Tetris with probability 1. This can be the basis for a competition between programs: who can last longer?
No comments :
Post a Comment