The Knotting-Unknotting Game played on Sums of Rational Shadows
  We consider the recently introduced knotting-unknotting game, in which two players take turns resolving crossings in a knot diagram which initially is missing all its crossing information. Once the knot is fully resolved, the winner is decided by whether the knot is equivalent to the unknot. In this paper we determine which player wins under perfect play in the initial positions (knot shadows) that are guaranteed to produce rational knots or sums of rational knots. This is accomplished in part by an analysis of the effects of pseudo Reidemeister moves on positions, and a computer verification of some cases. 
William Johnson
math.CO math.GT