|
PBeFS
Parallel Best-First Search
|
Header file for the class NQueens, which implements the Domain concept [see Domain.h] for the n-queens problem in the incremental formulation of section 3.2.1 of Russell and Norvig, "Artificial Intelligence: A Modern Approach" (3rd edition, 2010). More...
#include <array>#include <cstddef>#include <cstdint>#include <cstdlib>#include <cstring>#include <stdexcept>#include "PBeFS/astar/Domain.h"Go to the source code of this file.
Classes | |
| class | NQueens |
| the n-queens problem, with at most 32 queens More... | |
| struct | NQueens::Board |
| a board: the queens placed and the row of each of them More... | |
Namespaces | |
| namespace | PBeFS_di_unipi_it |
| namespace for the Parallel Best-First Search library | |
Header file for the class NQueens, which implements the Domain concept [see Domain.h] for the n-queens problem in the incremental formulation of section 3.2.1 of Russell and Norvig, "Artificial Intelligence: A Modern Approach" (3rd edition, 2010).