PushPush (Erik Demaine)

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

Yevhenii Diomidov's research works

PDF] PushPush is NP-hard in 2D

Curriculum Vitæ - Erik Demaine

Pushing Blocks (Erik Demaine)

Curriculum Vitæ - Erik Demaine

Lecture 4: SAT I Algorithmic Lower Bounds: Fun with Hardness

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

Pushing Blocks (Erik Demaine)

Curriculum Vitæ - Erik Demaine

PDF] PushPush-k is PSPACE-Complete

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push