We study the computational complexity of Arrival, a zero-player game on n-vertex switch graphs introduced by Dohrau, Gärtner, Kohler, Matoušek, and Welzl. They showed that the problem of deciding termination of this game is contained in NP ∩ coNP. Karthik C. S. recently introduced a search variant of Arrival and showed that it is in the complexity class PLS. In this work, we significantly improve the known upper bounds for both the decision and the search variants of Arrival. First, we resolve a question suggested by Dohrau et al. and show that the decision variant of Arrival is in UP ∩ coUP. Second, we prove that the search variant of Arrival is contained in CLS. Third, we give a randomized O(1.4143ⁿ)-time algorithm to solve both variants. Our main technical contributions are (a) an e ciently verifiable characterization of the unique witness for termination of the Arrival game, and (b) an e cient way of sampling from the state space of the game. We show that the problem of finding the unique witness is contained in CLS, whereas it was previously conjectured to be FPSPACE-complete. The e cient sampling procedure yields the first algorithm for the problem that has expected runtime O(cⁿ) with c < 2.