Author: Edward Seid
Date: 20:50:52 11/21/03
Go up one level in this thread
Dann, since you seem to be in the mood to answer questions, I hope you don't mind if I squeeze one in. I understand that the bigger problem with hashing is that it's (remotely) possible for 2 positions to generate the same hash signature. Is anything ever done about this remote possiblility, or do programmers simply ignore this? I've heard of something called a hash "lock", but I'm not sure how it's related to this. Another, more general, question. I understand that a full board scan is done in the starting position, then every incremental XORs are performed to get a new hash key. Consider a position, say after 10 moves. Will the hash keys of the original scan + incremental XORs be the same as a full-board scan of the current position? Finally, you've demonstrated a lot of knowledge about chess programming. Is there any chance for 1) a Dann Corbit FAQ on Chess Programming or 2) a 100% Dann Corbit engine? TIA.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.