Efficiency of algorithms in the Metropolis Monte Carlo method is exami
ned for the problem of random walks on random lattices. Three types of
algorithms, which satisfy the detailed balance, are considered. The e
fficiency mainly depends on the relative ease in obtaining geometrical
factors and Boltzmann factors. The most efficient algorithm for the d
ynamical triangulation of random surfaces is suggested.