%0 Journal Article
%T An NL-Complete Puzzle
%A Holger Petersen
%J Computer Science
%D 2015
%I arXiv
%X We investigate the complexity of a puzzle that turns out to be NL-complete.
%U http://arxiv.org/abs/1507.02723v1