It is well known that any two diagrams representing the same oriented link
are related by a finite sequence of Reidemeister moves O1, O2 and O3. Depending
on orientations of fragments involved in the moves, one may distinguish 4
different versions of each of the O1 and O2 moves, and 8 versions of the O3
move. We introduce a minimal generating set of oriented Reidemeister moves,
which includes two moves of types O1 and O2, and only one move of type O3. We
then consider other sets of moves and show that only few of them generate all
Reidemeister moves.