Projected equation and aggregation-based approximate dynamic programming methods for Tetris
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.
Main Author: | Hwang, Daw-sen |
---|---|
Other Authors: | Dimitri P. Bertsekas. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/66033 |
Similar Items
-
Tetris is Hard, Even to Approximate
by: Demaine, Erik D., et al.
Published: (2023) -
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,...
by: Demaine, Erik D, et al.
Published: (2020) -
Models of common errors in a Tetris session
by: Chang, Alice Ai-Yuan.
Published: (2020) -
Optimization problems with incomplete information
by: Hwang, Daw-sen
Published: (2016) -
Tetris is NP-hard even with O (1) Rows or Columns
by: Asif, Sualeh, et al.
Published: (2022)