We present a study of a dynamical quantum game. Each agent has a 'memory' o
f her performance over the previous ni timesteps, and her strategy can evol
ve in time. The game exhibits distinct regimes of optimality. For small m t
he classical game performs better, while for intermediate m the relative pe
rformance depends on whether the source of qubits is 'corrupt'. For large m
, the quantum players dramatically outperform the classical players by 'fre
ezing' the game into high-performing attractors in which evolution ceases.