| |
| | Tetris AI : computer plays Tetris |
 | | For example, it seems reasonable to infer that the developers of the first IBM-PC implementation of the Tetris game intended to select the shape of each new falling piece "randomly", and that the use of the Borland C implementation of the rand() function was merely a practical approximation of the intention. |
 | | It seems that, based on various observations, the multidimensional function of average Tetris performance as a function of the weights, e.g., F(w1,w2,w3,...), is "rough" (lots of local minima and maxima), which means that a simple multidimensional "hill climbing" might not work. |
 | | The Standard Tetris application uses this strategy when the "Next Piece" is enabled by the user and is visible on the screen, and when a two-piece AI is enabled (such as the one written by me, Colin Fahey). |
| colinfahey.com /tetris/tetris.html (7368 words) |
|