Jason,
If you use iterative deepening you would not have to worry about millisecond differences disqualifying you from the tournament. That is the point. It should take .000001 seconds to do a 1-ply search, and which is .000001 seconds on practically any machine (I doubt any machine you can find besides a TI-83 calculator will take 5 seconds to do a 1-ply search). As long as you output this move, then you will not be disqualified.
And I agree with some of the students, if you have questions, please phrase them with some semblance of courtesy. It has the effect of not putting off other students as well as TAs responding with more information...
Mike |