Skip to main content
deleted 1 character in body
Source Link
user119428
user119428

Demaine et al. proved in this paper that Tetris is NP-hard.

More of a gimmick but: Based on that paper, IstvánSzita & Lörincz tried to teach a number of algorithms to play Tetris in this paper.

Demaine et al. proved in this paper that Tetris is NP-hard.

More of a gimmick but: Based on that paper, István & Lörincz tried to teach a number of algorithms to play Tetris in this paper.

Demaine et al. proved in this paper that Tetris is NP-hard.

More of a gimmick but: Based on that paper, Szita & Lörincz tried to teach a number of algorithms to play Tetris in this paper.

Post Made Community Wiki by Todd Trimble
edited body
Source Link
user119428
user119428

Demaine et al. proved in this paper that Tetris is NP-hard.

More of a gimmick but: Based on that paper, István & Lörincz tried to teach a number of algorithms to play tetrisTetris in this paper.

Demaine et al. proved in this paper that Tetris is NP-hard.

More of a gimmick but: Based on that paper, István & Lörincz tried to teach a number of algorithms to play tetris in this paper.

Demaine et al. proved in this paper that Tetris is NP-hard.

More of a gimmick but: Based on that paper, István & Lörincz tried to teach a number of algorithms to play Tetris in this paper.

Source Link
user119428
user119428

Demaine et al. proved in this paper that Tetris is NP-hard.

More of a gimmick but: Based on that paper, István & Lörincz tried to teach a number of algorithms to play tetris in this paper.