- Generated by
1.15.0
|
PBeFS
Parallel Best-First Search
|
Header file for the class template SlidingTile, which implements the Domain concept [see Domain.h] for the sliding-tile puzzles with the Manhattan distance heuristic, and for the class Word128, the unsigned integer of 128 bits in which the boards of more than 16 cells are packed. More...
#include <array>#include <bit>#include <cstddef>#include <cstdint>#include <cstdlib>#include <ostream>#include <sstream>#include <stdexcept>#include <string>#include <type_traits>#include "PBeFS/astar/Domain.h"Go to the source code of this file.
Classes | |
| struct | Word128 |
| an unsigned integer of 128 bits, as two words of 64 More... | |
| class | SlidingTile< W, H > |
| the sliding-tile puzzle on a board of at most 25 cells More... | |
Namespaces | |
| namespace | PBeFS_di_unipi_it |
| namespace for the Parallel Best-First Search library | |
Typedefs | |
| using | EightPuzzle = SlidingTile< 3 , 3 > |
| the 8-puzzle | |
| using | FifteenPuzzle = SlidingTile< 4 , 4 > |
| the 15-puzzle | |
| using | TwentyFourPuzzle = SlidingTile< 5 , 5 > |
| the 24-puzzle | |
Header file for the class template SlidingTile, which implements the Domain concept [see Domain.h] for the sliding-tile puzzles with the Manhattan distance heuristic, and for the class Word128, the unsigned integer of 128 bits in which the boards of more than 16 cells are packed.
The puzzle with \( W H - 1 \) tiles is played on a board of \( W \times H \) cells.
1.15.0