On Tue, 10 Jul 2001 at 13:12:37 -0300, Raul Dias wrote:
> >
> >I've read numerous of times about Jon Orwants Rock-Paper-Scissors program
> >that is "Markov based" and "remains unbeaten since 1997".
>
> How can a markov based R-P-S can be unbeatable without cheating?
It chooses each of R, P and S with probability 1/3. This is unbeatable.
Fairly trivial as Markov processes go.
Jon's achivement is in creating the automated framework (EGGG) which allows
games to be defined easily, and R-P-S was included as a minimal game.
See:
http://www.research.ibm.com/journal/sj/393/part2/orwant.pdf
"The games that EGGG generates are Perl programs, and EGGG itself is
written in Perl."
Definitely fun with perl...
Ian
