We study a new Monte Carlo algorithm for generating self-avoiding walks with variable length (controlled by a fugacity fl) and fixed endpoints. The algorithm is a hybrid of local (BFACF) and nonlocal (cut-and-paste) moves.