The basis for enumerative techniques is simplicity itself. The problem here is obvious. This is horribly inefficient. For very large problem spaces, the computational task is massive, perhaps intractably so. Random Search Algorithms Random searches simply perform random walks of the problem space, recording the best optimum values discovered so far.
Efficiency is a problem here as well.
For large problem spaces, they should perform no better than enumerative searches. They do not use any knowledge gained from previous results and thus are both dumb and blind. Randomized Search Techniques Randomized search algorithms uses random choice to guide themselves through the problem search space. But these are not just simply random walks. These techniques are not directionless like the random search algorithms.