public void recordRep(long zobrist) {
		// TODO: Make this smoother with a better looking for empty places
		int hashkey = (int) (zobrist % HASHSIZE);

		if (hashtable[hashkey] == 0 || hashtable[hashkey] == zobrist) {
			hashtable[hashkey] = zobrist;
			return;
		}

		for (int i = 1; i < HASHSIZE; i++) {
			if (hashtable[(hashkey + i) % HASHSIZE] == 0) {
				hashtable[(hashkey + i) % HASHSIZE] = zobrist;
				return;
			}
		}
		
		logger.error("Error: Repetition table is full");
	} // END recordRep