indeed. i too support the TAs and encourage you to spend your energy reading about iterative depth instead of flaming the people who are probably spending more time on this project than any of us, just to make it possible.
ANYWAY,
if you don't want to spend five minutes learning how iterative depth resolves timing issues, here it is. the concept of iterative depth is to come up with a (fairly bad) move right off the bat and output it. then search a little deeper, and output those results, etc. this way, you don't have to worry about when you get cut off, you just keep working and outputting the results as you get them. the tournament daemon will only recognize the last move you output, which by the way will (in theory) be the best one. hope that helps, good luck to all in the tourney...
-Dave |