Abstract
•Dohrau et al. studied a decision problem on switch graphs called ‘Arrival’.
•We studied the search version of the Arrival problem, called ‘S-Arrival’.
•We showed that S-Arrival is in the class PLS.
Recently, Dohrau et al. studied a zero-player game on switch graphs and proved that deciding the termination of the game is in NP∩coNP. In this short paper, we show that the search version of this game on switch graphs, i.e., the task of finding a witness of termination (or of non-termination) is in PLS.