Parrondo games are coin flipping games with the surprising property that
alternating plays of two losing games can produce a winning game. We show that
this phenomenon can be modelled by probabilistic lattice gas automata.
Furthermore, motivated by the recent introduction of quantum coin flipping
games, we show that quantum lattice gas automata provide an interesting
definition for quantum Parrondo games.Comment: 12 pages, plain TeX, 10 PostScript figures included with epsf.tex
(ignore the under/overfull \vbox error messages); for related work see
http://math.ucsd.edu/~dmeyer/research.htm
