|
|||||||
|
|
|
|
|
|
|
||
| Report ID: | 05-06-05 |
| Initial Submission Date: | 2005-06-24 |
| Title: | Tetris: A Study of Randomized Constraint Sampling |
| Summary: | Using the linear programming approach to approximate dynamic programming, we generate an algorithm for playing Tetris. In the process, we explore practical issues arising in the use of constraint sampling techniques. |
| Authors: | Farias, Vivek; Van Roy, Benjamin |
| Contact email: | bvr@stanford.edu |
| Number of views : 1214 Number of downloads : 554 |
| Version | Date | Accessible? | Download |
| 1 | 2005-06-24 | y | download |