Twisting and unknotting operations.
We define a twisting move, an (n,k)-move, on a link diagram and consider the question as to whether or not any two links are equivalent by this move. Moreover we show that any knot can be trivialized by at most twice twisting operations.