Is a very general search algorithm that consist of "systematically" enumerate all possible combinations.
E.g. 8-Queen problem, enumerate all possible arrangements of 8 pieces on 64 square chessboard.
Properties:
1. Very general and can be applied to many many problems.
2. Generally very very slow.