2010/07/19 by Savelyev, Yasha
#91A05 #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.1007.3310
We construct a symmetric, simultaneous, deterministic evolution game SGo, which is in a certain mathematical sense a symmetrization of the classical board game Go. SGo is in some ways a simpler game than Go, as Komi, Ko and suicide rules are removed. On the other hand it has similar dynamics and move sensitivity, enabled by certain deterministic ``quantum state'' reduction, so that state evolution is deterministic. Using the argument of Nash, we show that SGo has a mixed equilibrium strategy to draw on average.