Login / Signup

A simple proof that the $(n^2-1)$-puzzle is hard.

Erik D. DemaineMikhail Rudoy
Published in: CoRR (2017)
Keyphrases