In knot theory there is a particular knot diagram operation called a crossing change. A sequence of crossing changes is sufficient to turn any knot diagram into a diagram of an unknot, but it is not necessary to make a sequence of individual crossing changes to unknot a knot. We can add restrictions to how the knot diagram's crossing information is changed, and still end up with a viable sequence of operations which can unknot any knot diagram.

This talk will explore a few possible ways of loosening these restrictions and the proof methods used to show they are still sufficient for an unknotting operation. If time allows, then a game based on these unknotting operations will be presented.