  In the dual formulation of d=3 SU(2) LGT, the link variables are group
representations and valid configurations are those satisfying a number of
triangle inequalities. In \cite{lat99} algorithms for local updates that
automatically respect these constraints were described. It was also pointed out
there that these local updates were not ergodic. In this presentation, we
describe two different quasi-local updating algorithms which, in conjunction
with the local updates, appear to be ergodic.
