Header file for the concepts a search problem has to satisfy in order to be searched by the algorithm...
void for_each_successor(const Board &s, int h, F &&f) const
calls f( t , 1 , h - 1 ) for each row of the column free of attacks
Definition NQueens.h:124