Theoretical Computer ScienceVolume 131, Issue 2, 12 September 1994, Pages 431-439Mathematical gamesReachability is decidable in the numbers gameAuthor links open overlay panelK. ErikssonShow moreShareCitehttps://doi.org/10.1016/0304-3975(94)90182-1Get rights and contentUnder an Elsevier user licenseopen archiveAbstractGiven two integral positions p and q in the numbers game of Mozes, can one decide whether q can be reached by playing from p? The answer is yes.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1994 Published by Elsevier B.V.