A search algorithm which is based on arc-consistency without propagation, suitable for solution of constant satisfaction problems. While after an assignment, backtracking checks consistency of the current tuple, forward checking filters the domains of future variables as soon as it assigns a value to the current variable. In that manner, inconsistencies are detected earlier, in fact as soon as such filtering leaves the domain of some future variable empty.
An example: Search tree for 6-queens using forward checking