|
PBeFS
Parallel Best-First Search
|
a distribution whose owners follow the moves More...
#include <PBeFS/astar/Distribution.h>
a distribution whose owners follow the moves
key( s ) is a 32-bit key of s, whose owner among p workers is key_owner( key( s ) , p ), and key( k , s , t ), with k = key( s ) and t a successor of s, is key( t ): a search that keeps the key of each node computes the key, and then the owner, of each successor in the time of the features that its move changes.