|
PBeFS
Parallel Best-First Search
|
HDA*[P]: the perfect hash of the Domain modulo p. More...
#include <PBeFS/astar/Distribution.h>
Public Member Functions | |
| PerfectHashDistribution (const D &domain, std::uint64_t=1) | |
| unsigned | owner (const state_t< D > &s, unsigned p) const |
Static Public Member Functions | |
| static std::string | name (void) |
HDA*[P]: the perfect hash of the Domain modulo p.
The distribution "HDA*" of Burns et al. (JAIR 2010): with the rank of the permutation of the tiles, modulo p only the last few tiles matter, and Jinnai and Fukunaga (JAIR 2017) find both a high search and a high communication overhead. It is kept to reproduce that comparison.
|
inlineexplicit |
|
inlinestaticnodiscard |
|
inlinenodiscard |