Elsevier

Theoretical Computer Science

Volume 131, Issue 2, 12 September 1994, Pages 431-439
Theoretical Computer Science

Mathematical games
Reachability is decidable in the numbers game

https://doi.org/10.1016/0304-3975(94)90182-1Get rights and content
Under an Elsevier user license
open archive

Abstract

Given 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.

Cited by (0)