m |
m |
||
| Line 7: | Line 7: | ||
For the demo part of Stage 2, here is a presentation on how to implement a one-step look-ahead and zero-step look-ahead Tetris algorithm. These algorithms were designed for normal Tetris, but the same ideas could be translated into Super Tetris. | For the demo part of Stage 2, here is a presentation on how to implement a one-step look-ahead and zero-step look-ahead Tetris algorithm. These algorithms were designed for normal Tetris, but the same ideas could be translated into Super Tetris. | ||
| − | [[Media:TetrisPresentation.ppt | Presentation over algorithms for Tetris AI]] | + | [[Media:TetrisPresentation.ppt | Presentation over algorithms for Tetris AI]] (Unfortunately the videos do not work) |
---- | ---- | ||
[https://kiwi.ecn.purdue.edu/rhea/index.php/2009_Fall_ECE_462_Lu Back to ECE462] | [https://kiwi.ecn.purdue.edu/rhea/index.php/2009_Fall_ECE_462_Lu Back to ECE462] | ||
Revision as of 07:56, 9 October 2009
Super Tetris
Super Tetris has the same rules of Tetris except the tetrominoes have five or more blocks in each piece. The pieces do not have holes built into them.
Demo Mode
For the demo part of Stage 2, here is a presentation on how to implement a one-step look-ahead and zero-step look-ahead Tetris algorithm. These algorithms were designed for normal Tetris, but the same ideas could be translated into Super Tetris.
Presentation over algorithms for Tetris AI (Unfortunately the videos do not work)
