Abstract Zobrist Hashing: An Efficient Work Distribution Method for Parallel Best-First Search