PushPush (Erik Demaine)
![PushPush (Erik Demaine)](https://erikdemaine.org/pushpush/anim.gif)
![](https://d3i71xaburhd42.cloudfront.net/2f381b8d6ce3e8ef180b90d24d7393157ff7cf8a/9-Figure7-1.png)
PDF] PushPush is NP-hard in 2D
![](http://courses.csail.mit.edu/6.890/fall14/lectures/sample_frame_small.jpg)
Lectures in Algorithmic Lower Bounds: Fun with Hardness Proofs (6.890)
![](https://upload.wikimedia.org/wikipedia/commons/thumb/8/86/Erik_Demaine%2C_the_genius_that_plays_for_a_living-VPRO-The_Mind_of_the_Universe.ogv/400px--Erik_Demaine%2C_the_genius_that_plays_for_a_living-VPRO-The_Mind_of_the_Universe.ogv.jpg)
English subtitles for clip: File:Erik Demaine, the genius that
![](https://d3i71xaburhd42.cloudfront.net/ddee307f55d7ab86139b0f0cb38e6ad46478857c/3-Figure1-1.png)
PDF] PushPush and Push-1 are NP-hard in 2D
Games Puzzles and Computation, PDF
Games Puzzles and Computation, PDF
![](https://www.researchgate.net/profile/Dominique-Thiebaut/publication/220481861/figure/fig2/AS:669497287516163@1536632000555/Solution-path-for-Eq-2_Q320.jpg)
PDF) PushPush is NP-hard in 3D
![](https://0.academia-photos.com/attachment_thumbnails/66764146/mini_magick20210501-24341-7xz4xs.png?1619903177)
PDF) Finding a Hamiltonian Path in a Cube with Specified Turns is
![](https://d3i71xaburhd42.cloudfront.net/2f381b8d6ce3e8ef180b90d24d7393157ff7cf8a/5-Figure2-1.png)
PDF] PushPush is NP-hard in 2D
![](https://drops.dagstuhl.de/storage/00lipics/lipics-vol049-fun2016/thumbnails/LIPIcs.FUN.2016.1/LIPIcs.FUN.2016.1.png)
2048 Without New Tiles Is Still Hard
Proposer des recherches