Girard’s Geometry of Interaction offers a low-level decomposition of the cut-elimination process in linear logic, which can be used as a compilation technique for functional programming languages. It is the basis of the Geometry of Interaction Machine, which performs call-by-name computations in graph representations of functional programs without doing any graph reduction. Computation is given by a graph traversal algorithm: a simple intuition is that of a single token traveling through a fixed graph (the program to be evaluated), unraveling the evaluation. Here we continue this line of research to derive alternative ways of following this execution path which give call-by-alue computations.