Grid search is the simplest form of hyperparameter search, in which a set of possible values is specified for each hyperparameter and the cartesian product is explored. While grid search is exhaustive and easy to understand, it is typically a big waste of time. Unless you have discrete hyperparameters with very few possible value combinations, grid search is best avoided. It can be made less awful using successive halving.