We introduce several bilocal algorithms for lattice self-avoiding walks. We
discuss their ergodicity in different confined geometries, for instance in
strips and in slabs. A short diseussion of the dynamical properties in the
absence of interactions is given.