PushPush (Erik Demaine)

PDF] PushPush is NP-hard in 2D

Lectures in Algorithmic Lower Bounds: Fun with Hardness Proofs (6.890)

English subtitles for clip: File:Erik Demaine, the genius that

PDF] PushPush and Push-1 are NP-hard in 2D

Games Puzzles and Computation, PDF

Games Puzzles and Computation, PDF

PDF) PushPush is NP-hard in 3D

PDF) Finding a Hamiltonian Path in a Cube with Specified Turns is

PDF] PushPush is NP-hard in 2D

2048 Without New Tiles Is Still Hard