We present a new category of games on graphs as a model for
Intuitionistic Linear Logic. The model has the computational flavour
of concrete data structures but embeds fully and faithfully in an
abstract games model. The resulting model for PCF differs markedly
from the sequential algorithms model. However we show that the
extensional collapse consists of the sequentially realizable
functionals. This provides support for the Longley Conjecture.