class TranspositionTable {

	public synchronized SearchNode findIfPresent(long fancyHash) {
		final int start = ((int) fancyHash & IGNORE_SIGN_BIT) % table.length;
		int slot = start;
		do {
			final SearchNode n = table[slot];
			if (n.isInUse()) {
				if (n.getFancyHash() == fancyHash) {
					return n;
				}
			} else {
				return null;
			}
			slot = (slot + 1) % table.length;
		} while (slot != start);
		return null;
	}

	public  TranspositionTable(int megabytes, SearchNodeBuilder builder,
			CoordinateSystem coords);

}